Day23代码随想录 | ● 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); 
            return right;
        }
        if (root->val > high) {
            TreeNode* left = trimBST(root->left, low, high); 
            return left;
        }
        root->left = trimBST(root->left, low, high); 
        root->right = trimBST(root->right, low, high); 
        return root;
    }
};

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 {
private:
    TreeNode* traveral(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=traveral(nums,left,mid-1);
        root->right=traveral(nums,mid+1,right);
        return root;
    }
public:
    TreeNode* sortedArrayToBST(vector<int>& nums) {
       TreeNode*root=traveral(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;

    }
};