代码随想录第二十二天 二叉树part08

第一题. 修剪二叉搜索树 

class Solution {
public:
    TreeNode* trimBST(TreeNode* root, int low, int high) {
        if(root == nullptr) return nullptr;
        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;
    }
};

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

class Solution {
public:
    TreeNode* traversal(vector<int> &nums,int left,int right){
        if(left > right) return nullptr;
        int mid = (left + right)/2;
        TreeNode* root = new TreeNode(nums[mid]);
        root->left = traversal(nums,left,mid-1);
        root->right = traversal(nums,mid+1,right);
        return root;
    };
    TreeNode* sortedArrayToBST(vector<int>& nums) {
        return traversal(nums,0,nums.size()-1);
    }
};

第三题.二叉搜索树转换为累加树

 

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