标签:png turn ret root load NPU ESS modify com
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:
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]
Constraints:
1
and 100
.0
and 100
.class Solution { int sum = 0; public TreeNode convertBST(TreeNode root) { convert(root); return root; } public void convert(TreeNode root) { if(root == null) return; convert(root.right); root.val += sum; sum = root.val; convert(root.left); } }
wdnmd你知道和538一样害po出来??
1038. Binary Search Tree to Greater Sum Tree
标签:png turn ret root load NPU ESS modify com
原文地址:https://www.cnblogs.com/wentiliangkaihua/p/13516947.html