Leetcode701 BST中的插入操作

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
递归
class Solution {
    public TreeNode insertIntoBST(TreeNode root, int val) {
        if(root==null){
            root=new TreeNode(val);
        }
        if(root.val>val){
            root.left=insertIntoBST(root.left,val);
            //记得标识 root.left=,否则无返回插入后的树
        }
        if(root.val<val){
            root.right=insertIntoBST(root.right,val);
        }
        return root;
    }
}
评论 1
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值