题目:
在一个搜索二叉树中插入数据
代码
/**
* 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 node = root;
while (node != null) {
if (node.val>val){
if (node.left==null){
node.left = new TreeNode(val);
break;
}else {
node = node.left;
}
}else{
if (node.right==null){
node.right = new TreeNode(val);
break;
} else {
node = node.right;
}
}
}
return root;
}
}