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

 669. 修剪二叉搜索树

题目链接

669. 修剪二叉搜索树

我的题解

/**
 * 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 == nullptr) return nullptr;
        if (root->val < low) return trimBST(root->right, low, high);
        if (root->val > high) return trimBST(root->left, low, high);
        root->left = trimBST(root->left, low, high);
        root->right = trimBST(root->right, low, high);
        return root;
    }
};

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

题目链接

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

我的题解

/**
 * 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* sortedArrayToBST_2(vector<int>& nums, int start, int end) {
        if (start == end) return nullptr;
        int middle = start + (end - start) / 2;
        TreeNode* node = new TreeNode(nums[middle]);
        node->left = sortedArrayToBST_2(nums, start, middle);
        node->right = sortedArrayToBST_2(nums, middle + 1, end);
        return node;
    }
    TreeNode* sortedArrayToBST(vector<int>& nums) {
        return sortedArrayToBST_2(nums, 0, nums.size());
    }
};

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

题目链接

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

我的题解

/**
 * 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 cnt = 0;
    void convertBST_2(TreeNode* root) {
        if (root == nullptr) return;
        convertBST_2(root->right);
        cnt += root->val;
        root->val = cnt;
        convertBST_2(root->left);
    }
    TreeNode* convertBST(TreeNode* root) {
        convertBST_2(root);
        return root;
    }
};