代码随想录—Day21

最新推荐文章于 2024-10-12 22:21:30 发布

tangt_fighting

最新推荐文章于 2024-10-12 22:21:30 发布

阅读量172

点赞数 3

文章标签：算法 leetcode 数据结构

本文链接：https://blog.csdn.net/Tzx_fighting/article/details/140078634

版权

669.修剪二叉搜索树

class Solution {
public:
    TreeNode* trimBST(TreeNode* root, int low, int high) {
        if(root == NULL){
            return root;
        }
        if(root->val > high){
            TreeNode* left = trimBST(root->left,low,high);
            return left;
        }
        if(root->val < low){
            TreeNode* right = trimBST(root->right,low,high);
            return right;
        }

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

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

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

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

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

class Solution {
private:
    int pre = 0;
    void traversal(TreeNode* cur){
        if(cur == NULL){
            return;
        }
        traversal(cur->right);
        cur->val += pre;
        pre = cur->val;
        traversal(cur->left);
    }

public:
    TreeNode* convertBST(TreeNode* root) {
        pre = 0;
        traversal(root);
        return root;
    }
};