45-Binary Search Tree to Greater Sum Tree

最新推荐文章于 2021-06-07 02:32:32 发布

yanguo110

最新推荐文章于 2021-06-07 02:32:32 发布

阅读量106

点赞数

分类专栏：慢慢爬之轻算法

本文链接：https://blog.csdn.net/yanguo110/article/details/104538003

版权

慢慢爬之轻算法专栏收录该内容

49 篇文章 0 订阅

订阅专栏

题目地址：Binary Search Tree to Greater Sum Tree
Given the root of a binary search tree with distinct values, modify it so that every node has a new value equal to the sum of the values of the original tree that are greater than or equal to node.val.
As a reminder, a binary search tree is a tree that satisfies these constraints:
The left subtree of a node contains only nodes with keys less than the node’s key.
The right subtree of a node contains only nodes with keys greater than the node’s key.
Both the left and right subtrees must also be binary search trees.
Example 1:
Input: [4,1,6,0,2,5,7,null,null,null,3,null,null,null,8]
Output: [30,36,21,36,35,26,15,null,null,null,33,null,null,null,8]
Note:
The number of nodes in the tree is between 1 and 100.
Each node will have value between 0 and 100.
The given tree is a binary search tree.

借鉴：https://leetcode.com/problems/binary-search-tree-to-greater-sum-tree/discuss/286725/JavaC%2B%2BPython-Revered-Inorder-Traversal

public TreeNode bstToGst(TreeNode root) {  
        bstToGst(root, 0);
        return root;
    }
    public int bstToGst(TreeNode root, int preInt) {
        if (root == null) {
            return 0;
        }
        int sum  = bstToGst(root.right, preInt) + root.val;
        root.val =  sum+preInt;
        sum = bstToGst(root.left, root.val)+ sum;
        return sum; 
    }
}