代码随想录-二叉树9（669. 修剪二叉搜索树、108. 将有序数组转换为二叉搜索树、538. 把二叉搜索树转换为累加树）

669. 修剪二叉搜索树

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); // 寻找符合区间[low, high]的节点
            return right;
        }
        if (root->val > high) {
            TreeNode* left = trimBST(root->left, low, high); // 寻找符合区间[low, high]的节点
            return left;
        }
        root->left = trimBST(root->left, low, high); // root->left接入符合条件的左孩子
        root->right = trimBST(root->right, low, high); // root->right接入符合条件的右孩子
        return root;

    }
};

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

class Solution {
public:
    

    TreeNode* sortedArrayToBST(vector<int>& nums) 
    {
        if (nums.size()==0) return nullptr;
        int middle = nums[nums.size()/2];
        TreeNode* cur = new TreeNode(middle);

        vector<int> left = vector<int>(nums.begin(), nums.begin()+nums.size()/2);
        vector<int> right = vector<int>(nums.begin()+nums.size()/2+1, nums.end());

        cur->left = sortedArrayToBST(left);
        cur->right = sortedArrayToBST(right);

        return cur;
    }
};

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

class Solution {
public:
    TreeNode* pre = nullptr;

    void dfs(TreeNode* cur)
    {
        if (cur==nullptr) return;
        dfs(cur->right);
        if (pre!=nullptr) cur->val += pre->val;
        pre = cur;
        dfs(cur->left);
    }


    TreeNode* convertBST(TreeNode* root) 
    {
        if (root==nullptr) return root;
        dfs(root);
        return root;
    }
};