Method insert

Java/SearchingAlgorithms/BFS/BST.java:21–50

(int value)

    // insert
    public void insert(int value){
        if(root == null){
            Node n = new Node(value);
            root = n;
        }
        else{
            Node tmp = root;
            while(true){
                if(value >= tmp.value){
                    if(tmp.right == null){
                        tmp.right = new Node(value);
                        break;
                    }
                    else{
                        tmp = tmp.right;
                    }
                }
                else{
                    if(tmp.left == null){
                        tmp.left = new Node(value);
                        break;
                    }
                    else{
                        tmp = tmp.left;
                    }
                }
            }
            tmp = null;
        }
    }

    // find/lookup
    public boolean contains(int value){