Search
⌘K
Leetcode 1038. Binary Search Tree to Greater Sum Tree
Transform a BST so each node's value becomes its original value plus the sum of all keys greater than it; this is typically done with a reverse in-order traversal (right → node → left) while maintaining a running sum.
Question Timeline
See when this question was last asked and where, including any notes left by other candidates.
All Regions
Comments
Hello Interview Premium
Your account is free and you can post anonymously if you choose.