题目
给定二叉搜索树(BST)的根节点和要插入树中的值,将值插入二叉搜索树。 返回插入后二叉搜索树的根节点。 输入数据保证,新值和原始二叉搜索树中的任意节点值都不同。
注意,可能存在多种有效的插入方式,只要树在插入后仍保持为二叉搜索树即可。 你可以返回任意有效的结果。
代码
python版:
# Definition for a binary tree node.
# class TreeNode:
# def __init__(self, val=0, left=None, right=None):
# self.val = val
# self.left = left
# self.right = right
class Solution:
def insertIntoBST(self, root: TreeNode, val: int) -> TreeNode:
node = TreeNode(val,None,None)
if not root:
return node
flag = root
while flag:
if val<flag.val:
if not flag.left:
flag.left = node
break
else:
flag = flag.left
else:
if not flag.right:
flag.right = node
break
else:
flag = flag.right
return root
Java版:
/**
* Definition for a binary tree node.
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode() {}
* TreeNode(int val) { this.val = val; }
* TreeNode(int val, TreeNode left, TreeNode right) {
* this.val = val;
* this.left = left;
* this.right = right;
* }
* }
*/
class Solution {
public TreeNode insertIntoBST(TreeNode root, int val) {
if(root==null){
return new TreeNode(val);
}
TreeNode flag = root;
while(flag!=null){
if(val<flag .val){
if(flag.left==null){
flag.left = new TreeNode(val);
break;
}
else{
flag = flag.left;
}
}
else{
if(flag.right==null){
flag.right = new TreeNode(val);
break;
}
else{
flag = flag.right;
}
}
}
return root;
}
}