[JAVA]450.删除二叉搜索树中的节点 | 669. 修剪二叉搜索树 | 108.将有序数组转换为二叉搜索树 | 538.把二叉搜索树转换为累加树

class Solution {
    public TreeNode deleteNode(TreeNode root, int key) {
        if(root == null) return root;
        if(root.val == key){
            if(root.left != null && root.right == null){
                return root.left;
            }else if(root.left == null && root.right != null){
                return root.right;
            }else{
                TreeNode cur = root.right;
                while(cur.left != null){
                    cur = cur.left;
                }
                cur.left = root.left;
                root = root.right;
                
            }
        }
        if(root.val > key) root.left = deleteNode(root.left,key);
        if(root.val > key) root.right = deleteNode(root.right,key);
        return root;
    }
}

class Solution {
    public TreeNode trimBST(TreeNode root, int low, int high) {
        if(root == null){
            return null;
        }
        if(root.val < low){
            return trimBST(root.right, low, high);
        }
        if(root.val > high){
            return trimBST(root.left, low, high);
        }
        root.left = trimBST(root.left, low, high);
        root.right = trimBST(root.right, low, high);
        return root;
}
}

class Solution {
    public TreeNode sortedArrayToBST(int[] nums) {
        return sortedArray(nums, 0 , nums.length);
    }
    public TreeNode sortedArray(int[] nums, int left, int right){
        if(right <= left ) return null;
        if(right - left == 1){
            return new TreeNode(nums[left]);
        }
        int mid = left + (right - left)/2;
        TreeNode root = new TreeNode(nums[mid]);
        root.left = sortedArray(nums, left, mid );
        root.right = sortedArray(nums, mid + 1 , right );
        return root;
    }
}

class Solution {
    int sum;
    public TreeNode convertBST(TreeNode root) {
        sum = 0;
        convert(root);
        return root;
    }
    public void convert(TreeNode root){
        if(root == null) return;
        convert(root.right);
        sum += root.val;
        root.val = sum;
        convert(root.left);
    }
}