[leetcode]538. Convert BST to Greater Tree

最新推荐文章于 2024-04-10 20:23:41 发布

xiaocong1990

最新推荐文章于 2024-04-10 20:23:41 发布

阅读量211

点赞数

CC 4.0 BY-SA版权

分类专栏： leetcode 树

本文链接：https://blog.youkuaiyun.com/xiaocong1990/article/details/72859632

leetcode 同时被 2 个专栏收录

473 篇文章

订阅专栏

树

60 篇文章

订阅专栏

本文介绍了一种将二叉搜索树（BST）转换为Greater Tree的方法。转换后的每个节点值等于原值加上所有大于该值节点的和。通过递归遍历实现了节点值的更新。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

题目链接:https://leetcode.com/problems/convert-bst-to-greater-tree/#/description

Given a Binary Search Tree (BST), convert it to a Greater Tree such that every key of the original BST is changed to the original key plus sum of all keys greater than the original key in BST.

Example:

Input: The root of a Binary Search Tree like this:
              5
            /   \
           2     13

Output: The root of a Greater Tree like this:
             18
            /   \
          20     13

class Solution {
private:
    int cur_sum = 0;
public:
    void travel(TreeNode* root){
        if (!root) return;
        if (root->right) travel(root->right);
        
        root->val = (cur_sum += root->val);
        if (root->left) travel(root->left);
    }
    TreeNode* convertBST(TreeNode* root) {
        travel(root);
        return root;
    }
};