【简单】Lintcode 85:在二叉查找树中插入节点

 

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

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

样例

给出如下一棵二叉查找树，在插入节点6之后这棵二叉查找树可以是这样的：

  2             2
 / \           / \
1   4   -->   1   4
   /             / \ 
  3             3   6

挑战

能否不使用递归？

注意事项

You can assume there is no duplicate values in this tree + node.

解题思路1：

    递归。利用平衡二叉树的性质即可写出。

/**
 * 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
        if(root == null)
            return node;
        
        if(node.val < root.val)
            root.left = insertNode(root.left, node);
        else
            root.right = insertNode(root.right, node);
            
        return root;
    }
}

解题思路2：

    非递归方法：双指针法。

/**
 * 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
        if(root == null)
            return node;
        
        TreeNode pre = null;//指向需要插入节点的父节点
        TreeNode cur = root;//指向需要插入的节点
        
        while(cur != null){
            pre = cur;
            cur = node.val > cur.val ? cur.right : cur.left;
        }
        
        //将cur节点链接上pre
        cur = node;
        if(pre.val > node.val)
            pre.left = cur;
        else
            pre.right = cur;
            
        return root;
    }
}