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

目录

669 修剪二叉搜索树  

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

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

---

669 修剪二叉搜索树  

class Solution {
public:
    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 将有序数组转换为二叉搜索树  

class Solution {
public:
    TreeNode* tree(vector<int> &nums, int start, int end){
        if(start > end){
            return NULL;
        }

        if(start == end) {
            TreeNode* node = new TreeNode(nums[start]);
            return node;
        }

        int mid = abs(start + end) / 2;

        int leftstart = start;
        int leftend = mid - 1;

        int rightstart = mid + 1;
        int rightend = end;
 
        TreeNode* root = new TreeNode(nums[mid]);
        cout << nums[mid] << " ";

        root->left = tree(nums, leftstart, leftend);
        root->right = tree(nums, rightstart, rightend);

        return root;
    }

    TreeNode* sortedArrayToBST(vector<int>& nums) {
        return tree(nums, 0, nums.size()-1);
    }
};

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

class Solution {
public:
    int sum = 0;

    TreeNode* convertBST(TreeNode* root) {
        if(root == NULL) return NULL;
        
        root->right = convertBST(root->right);
        sum += root->val;
        root->val = sum;
        root->left = convertBST(root->left);
        return root;

    }
};