java 代码

package leetcode.二叉搜索树;

public class _701_二叉搜索树中的插入操作 {
    public TreeNode insertIntoBST(TreeNode root, int val) {
        if(root == null) return new TreeNode(val);
        //找到父节点并创建新节点
        TreeNode node = root;
        TreeNode prenode = root;
        while(node!= null){
            prenode = node;
            if(node.val > val){
                node = node.left;
            }else{
                node = node.right;
            }
        }
        if(prenode.val>val){
            prenode.left = new TreeNode(val);
        }else{
            prenode.right = new TreeNode(val);
        }
        return root;
    }
}