Available question text
Given a BST, update each node's value to be its original value plus the sum of all greater node values, performing the transformation in-place. The typical solution uses a reverse in-order traversal to maintain a running suffix sum across nodes (up to 10^4 unique node values).
Related questions
Continue with questions that share topics or the same question type.
- Binary Search Tree to Greater Sum Tree
Coding · Binary Search Tree · Binary Tree · Depth-First Search
- Convert Binary Search Tree to Sorted Doubly Linked List
Coding
- Convert Binary Tree to Logical AND Tree
Coding
- Convert Graph to Binary Tree with Alternating Colors
Coding
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
Microsoft
Leetcode 538. Convert BST to Greater Tree
Reported Oct 8, 2025 · 2 source reports
MID_LEVEL
Source snapshot: Nov 12, 2026
View source