【java】701. Insert into a Binary Search Tree

Given the root node of a binary search tree (BST) and a value to be inserted into the tree, insert the value into the BST. Return the root node of the BST after the insertion. It is guaranteed that the new value does not exist in the original BST.

Note that there may exist multiple valid ways for the insertion, as long as the tree remains a BST after insertion. You can return any of them.

For example,

Given the tree:
4
/
2 7
/
1 3
And the value to insert: 5

You can return this binary search tree:

     4
   /   \
  2     7
 / \   /
1   3 5

This tree is also valid:

     5
   /   \
  2     7
 / \   
1   3
     \
      4

answer one

java iterative 100%

 public TreeNode insertIntoBST(TreeNode root, int val) {
        if(root == null) return new TreeNode(val);
        TreeNode cur = root;
        while(true) {
            if(cur.val <= val) {
                if(cur.right != null) cur = cur.right;
                else {
                    cur.right = new TreeNode(val);
                    break;
                }
            } else {
                if(cur.left != null) cur = cur.left;
                else {
                    cur.left = new TreeNode(val);
                    break;
                }
            }
        }
        return root;
    }

answer two

recursive

    public TreeNode insertIntoBST(TreeNode root, int val) {
        if (root == null) {
            return new TreeNode(val);
        }
        if (val > root.val) {
            root.right = insertIntoBST(root.right, val);
        } else {
            root.left = insertIntoBST(root.left, val);
        }
        return root;
    }

answer three

Similar idea but with a stack instead of the while true

public TreeNode insertIntoBST(TreeNode root, int val) {
        if(root == null) return new TreeNode(val);
        TreeNode current = root;
        Deque<TreeNode> stack = new ArrayDeque<>();
        stack.offerLast(root);
        while(!stack.isEmpty()) {
            current = stack.pollLast();
            if(val > current.val) {
                if(current.right == null) {
                    current.right = new TreeNode(val);
                   return root;
                } else {
                    stack.offerLast(current.right);
                }
            } else {
                if(current.left == null) {
                    current.left = new TreeNode(val);
                    return root;
                } else {
                    stack.offerLast(current.left);
                }
            }
        }
        return root;   
    }

answer four

public TreeNode insertIntoBST(TreeNode root, int val) {
if (root == null) {
return new TreeNode(val);
}
if (root.val > val) {
root.left = insertIntoBST(root.left, val);
} else {
root.right = insertIntoBST(root.right, val);
}
return root;
}

answer five

[Java] Beats 100%. Simple and Elegant solution

class Solution {
    public TreeNode insertIntoBST(TreeNode root, int val) {
        if(root==null)
            return new TreeNode(val);
        if(root.val < val)
            root.right=insertIntoBST(root.right, val);
        else
            root.left=insertIntoBST(root.left, val);
        return root;
    }
}