代码随想录第23天|669. 修剪二叉搜索树，108.将有序数组转换为二叉搜索树 ，538.把二叉搜索树转换为累加树

LeetCode669.修剪二叉搜索树

题目链接：669. 修剪二叉搜索树 - 力扣（LeetCode）

思路：

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode() : val(0), left(nullptr), right(nullptr) {}
 *     TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
 *     TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
 * };
 */
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接入符合条件的左右孩子
        root->left = trimBST(root->left,low,high);
        root->right = trimBST(root->right,low,high);
        return root;
    }
};

LeetCode108.将有序数组转换为二叉树

题目链接：108. 将有序数组转换为二叉搜索树 - 力扣（LeetCode）

思路：

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode() : val(0), left(nullptr), right(nullptr) {}
 *     TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
 *     TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
 * };
 */
class Solution {
public:
    TreeNode* travel(vector<int>& nums, int left ,int right) {
        int mid = (left + right) / 2;
        if(left > right) return NULL;
        TreeNode* root = new TreeNode(nums[mid]);
        root->left = travel(nums,left,mid - 1);
        root->right = travel(nums,mid + 1,right);
        return root;
    }
    TreeNode* sortedArrayToBST(vector<int>& nums) {
        TreeNode* root = travel(nums,0,nums.size() - 1);
        return root;
    }
};

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

题目链接：538. 把二叉搜索树转换为累加树 - 力扣（LeetCode）

思路：

从树中可以看出累加的顺序是右中左，所以我们需要反中序遍历这个二叉树，然后顺序累加就可以了。

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode() : val(0), left(nullptr), right(nullptr) {}
 *     TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
 *     TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
 * };
 */
class Solution {
public:
    int pre = 0;
    void travel(TreeNode* root) {
        if(root == NULL) return;
        travel(root->right);//右
        root->val = pre + root->val;//中
        pre = root->val;
        travel(root->left);//左
        return ;
    }
    TreeNode* convertBST(TreeNode* root) {
        travel(root);
        return root;
    }
};