Day 23 | 669. 修剪二叉搜索树 108.将有序数组转换为二叉搜索树 538.把二叉搜索树转换为累加树

669. 修剪二叉搜索树

TreeNode* trimBST(TreeNode* root, int low, int high) {
        if(root == NULL) return NULL;
        if(root->val < low){
            TreeNode* right = trimBST(root->right,low,high);
            return right;
        }
        if(root->val > high){
            TreeNode* left = trimBST(root->left,low,high);
            return left;
        }
        root->left = trimBST(root->left,low,high);
        root->right = trimBST(root->right,low,high);
        return root;
    }

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

        

TreeNode* sortedArrayToBST(vector<int>& nums) {
        if(nums.size() == NULL) return NULL;
        int midIndex = nums.size() / 2;
        TreeNode* root = new TreeNode(nums[midIndex]);
        if(nums.size() == 1) return root;
        vector<int>left(nums.begin(), nums.begin() + midIndex);
        vector<int>right(nums.begin() + midIndex + 1, nums.end());
        root->left = sortedArrayToBST(left);
        root->right = sortedArrayToBST(right);
        return root;
    }

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

        

public:
    TreeNode* convertBST(TreeNode* root) {
        if(root == NULL) return NULL;
        convertBST(root->right);
        root->val += pre;
        pre = root->val;
        convertBST(root->left);
        return root;
    }
private:
    int pre = 0;