85. 在二叉查找树中插入节点

85. 在二叉查找树中插入节点

给定一棵二叉查找树和一个新的树节点，将节点插入到树中。

你需要保证该树仍然是一棵二叉查找树。

样例

样例 1:

输入: tree = {}, node= 1

输出: {1}

样例解释:

在空树中插入一个点，应该插入为根节点。

 

样例 2:

输入: tree = {2,1,4,3}, node = 6

输出: {2,1,4,3,6}

样例解释:

如下：

2 2

/ \ / \

1 4 --> 1 4

/ / \

3 3 6

挑战

能否不使用递归？

注意事项

保证不会出现重复的值

/**

* Definition of TreeNode:

* public class TreeNode {

*     public int val;

*     public TreeNode left, right;

*     public TreeNode(int val) {

*         this.val = val;

*         this.left = this.right = null;

*     }

* }

*/









public class Solution {

    /*

     * @param root: The root of the binary search tree.

     * @param node: insert this node into the binary search tree

     * @return: The root of the new binary search tree.

     */

    public TreeNode insertNode(TreeNode root, TreeNode node) {

        // write your code here

             Stack<TreeNode> stack = new Stack<>();

            if (root==null)return node;

            stack.add(root);

            TreeNode treeNode;

            while (!stack.isEmpty()) {

                treeNode = stack.pop();

                if (treeNode.val>node.val){

                    if (treeNode.left==null){

                        treeNode.left=node;

                    }else {

                        stack.push(treeNode.left);

                    }

                }else {

                    if (treeNode.right==null){

                        treeNode.right=node;

                    }else {

                        stack.push(treeNode.right);

                    }

                }

            }

            return root;

    }

}