题目描述:
代码如下:
/**
* 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;
* }
* }
*/
//比较树结点的val 比结点小则插入到该结点的左边,反之右边
class Solution {
public TreeNode insertIntoBST(TreeNode root, int val) {
if(root==null){
return new TreeNode(val);
}
if(root.val==val){
return root;
}else if(val<root.val){
root.left=insertIntoBST(root.left,val);
}else if(val>root.val){
root.right=insertIntoBST(root.right,val);
}
return root;
}
}