算法训练营第二十三天|Leetcode669. 修剪二叉搜索树 Leetcode108.将有序数组转换为二叉搜索树 Leetcode538.把二叉搜索树转换为累加树

Leetcode669. 修剪二叉搜索树

文章链接：代码随想录
题目链接：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 == NULL) return NULL;

        if (root->val > high) {
            TreeNode* l = trimBST(root->left, low, high);
            return l; 
        }
        if (root->val < low) {
            TreeNode* r = trimBST(root->right, low, high);
            return r;
        }

        root->left = trimBST(root->left, low, high);
        root->right = trimBST(root->right, low, high);

        return root;
    }
};

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

文章链接：代码随想录
题目链接：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* traversal(vector<int>& nums, int l, int r){
        if (l > r) return NULL;
        
        int mid = l + (r - l) / 2;
        TreeNode* root = new TreeNode(nums[mid]);

        root->left = traversal(nums, l, mid - 1);
        root->right = traversal(nums, mid + 1, r);

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

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

文章链接：代码随想录
题目链接：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:
    TreeNode* pre = new TreeNode();
    TreeNode* convertBST(TreeNode* root) {
        if (root == NULL) return NULL;

        convertBST(root->right);
        root->val += pre->val;
        pre = root;
        convertBST(root->left);

        return root;
    }
};

第二十三天打卡，昨天拍冰块照片，手有点冻伤了，今天把剩下冰块拿上来，拍几组照片再把水放了。
加油！！！