● 669. 修剪二叉搜索树 ● 108.将有序数组转换为二叉搜索树 ● 538.把二叉搜索树转换为累加树-CSDN博客

本文链接：https://blog.csdn.net/m0_59090532/article/details/131822435

文章提供了三个关于二叉搜索树的操作：修剪BST以保留值在指定范围内的节点；将有序数组转换为二叉搜索树；以及将二叉搜索树转换为累加树，其中每个节点的值等于其本身加上所有大于它的子节点的值。

摘要由CSDN通过智能技术生成

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

       } 
       root->left=trimBST(root->left,low,high);
       root->right=trimBST(root->left,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(vector<int>& nums) 
    {
        TreeNode*root=traversal(nums,0,nums.size()-1);
        return root;
    }
    TreeNode* traversal(vector<int>&nums,int left,int right)
    {
        if(left>right)
        return nullptr;
        int mid=(right-left)/2+left;
        TreeNode*root=new TreeNode(nums[mid]);
        root->left=traversal(nums,left,mid-1);
        root->right=traversal(nums,mid+1,right);
        return root;
    }
};

● 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 pre=0;
    TreeNode* convertBST(TreeNode* root) 
    {
       pre=0;
        traversal(root);
        return root;

    }
    void traversal(TreeNode*cur)
    {
        if(cur==nullptr)
        return;
        traversal(cur->right);
        cur->val+=pre;
        pre=cur->val;
        traversal(cur->left);


    }
};