701. 二叉搜索树中的插入操作

701. 二叉搜索树中的插入操作

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

递归法，当root位置为空时，放入这个val，然后由于递归函数节点自动连接，直接返回root

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