Leetcode Problem 538. Convert BST to Greater Tree
Leetcode Solutions
Reverse In-Order Traversal
- Initialize a variable
totalto 0 to keep track of the running sum. - Start from the root of the BST and perform a reverse in-order traversal.
- If the current node is not null, recursively traverse its right subtree.
- Add the current node's value to
total, updating the running sum. - Update the current node's value to
total. - Recursively traverse the left subtree of the current node.
- Continue this process until all nodes have been visited.
Iterative Reverse In-Order Traversal with a Stack
Ask Question
Programming Language
Purpose:
image/screenshot of info(optional)
Full Screen
Loading...
Suggested Answer
Answer
Full Screen
Copy Answer Code
Loading...