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.

Company

Level

Region

Comments

Your account is free and you can post anonymously if you choose.

Hello Interview Premium

Recent interview questions

System Design Guided Practice

Exclusive content

Learn More

Leetcode 1038. Binary Search Tree to Greater Sum Tree

Question Timeline

Comments

Questions

Learn

Links

Legal

Contact