代码随想录算法训练营第二十三天| 669. 修剪二叉搜索树 ，108.将有序数组转换为二叉搜索树 ，538.把二叉搜索树转换为累加树

代码随想录算法训练营

今日任务
669. 修剪二叉搜索树 ，108.将有序数组转换为二叉搜索树 ，538.把二叉搜索树转换为累加树

---

---

669. 修剪二叉搜索树

/**
 * 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 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;
    }
}

---

108.将有序数组转换为二叉搜索树

/**
 * 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 sortedArrayToBST(int[] nums) {
        return buildTree(nums,0,nums.length-1);
    }
    public TreeNode buildTree(int[] nums,int begin,int end){
        if(begin>end){
            return null;
        }

        int rootIndex=(begin+end)/2;
        TreeNode node=new TreeNode(nums[rootIndex]);
        int leftlen=rootIndex-begin;

        node.left=buildTree(nums,begin,begin+leftlen-1);
        node.right=buildTree(nums,rootIndex+1,end);

        return node;
    }
}

---

538.把二叉搜索树转换为累加树

/**
 * 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 {
    int sum=0;
    public TreeNode convertBST(TreeNode root) {
        if (root == null) {
            return null;
        }
        sumbst(root);
        return root;
    }
    public void sumbst(TreeNode root) {
        if (root == null) {
            return;
        }

        sumbst(root.right);
        sum=sum+root.val;
        root.val=sum;
        sumbst(root.left);
    }
}

---