在二叉查找树中插入节点

题目

给定一棵二叉查找树和一个新的树节点,将节点插入到树中。
你需要保证该树仍然是一棵二叉查找树。
http://www.lintcode.com/zh-cn/problem/insert-node-in-a-binary-search-tree/

分析

很基础的题目,递归进行插入即可。

代码


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

Get the latest posts delivered right to your inbox.