235. 二叉搜索树的最近公共祖先 701.二叉搜索树中的插入操作 450.删除二叉搜索树中的节点

235. 二叉搜索树的最近公共祖先

递归法：

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */

class Solution {
    public TreeNode lowestCommonAncestor(TreeNode root, TreeNode p, TreeNode q) {
        if(root == null) return root;
        if(p.val < root.val && q.val < root.val){
            TreeNode left = lowestCommonAncestor(root.left,p,q);
            if(left != null) return left;
        }
        if(p.val > root.val && q.val > root.val){
            TreeNode right = lowestCommonAncestor(root.right,p,q);
            if(right != null) return right;
        }
        //节点值介于p,q之间
        return root; 
    }
}

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
class Solution {
    public TreeNode lowestCommonAncestor(TreeNode root, TreeNode p, TreeNode q) {
        while(root!=null){
        if((root.val>p.val)&&(root.val>q.val)){
            root = root.left;
        }else if((root.val<p.val)&&(root.val<q.val)){
            root = root.right;
        }else{
            //一大一小 一等一大 一等一小
            return root;
        }
        }
        //两个指定节点在不相干的两个树上
        return null;
        
    }
}

701.二叉搜索树中的插入操作

递归思路没啥好说的

/**
 * 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){
            TreeNode node = new TreeNode(val);
            return node;
        }
        if(root.val < val){
            root.right = insertIntoBST(root.right,val);
        }else{
            root.left = insertIntoBST(root.left,val);
        }
        return root;

    }
}

450.删除二叉搜索树中的节点

难题：删除节点比增加节点复杂很多，尤其是删除节点的左右节点都不为null的情况下。

/**
 * 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 deleteNode(TreeNode root, int key) {
        if(root == null) return root;
        if(root.val > key){
            root.left = deleteNode(root.left,key);
        }else if(root.val < key){
            root.right = deleteNode(root.right,key);
        }else{
            if(root.left == null) return root.right;
            if(root.right == null) return root.left;
            //最复杂的就是左右都有节点
            TreeNode temp = root.right;
            //找到右子树的最小节点
            while(temp.left != null){
                temp = temp.left;
            }
            temp.left = root.left;
            return root.right;
        }
        return root;
    }
}