Leetcode Problem 1038. Binary Search Tree to Greater Sum Tree

1038. Binary Search Tree to Greater Sum Tree

Leetcode Solutions

Reverse Inorder Traversal

  1. Initialize a variable running_sum to 0 to keep track of the sum of node values visited so far.
  2. Define a recursive function reverse_inorder that takes a node and the running sum as arguments.
  3. If the node is null, return immediately.
  4. Recursively call reverse_inorder on the right child.
  5. Add the current node's value to running_sum.
  6. Update the current node's value to running_sum.
  7. Recursively call reverse_inorder on the left child.
  8. Call reverse_inorder on the root node to start the process.
  9. Return the modified tree.
UML Thumbnail

Iterative Reverse Inorder Traversal Using Stack

Ask Question

Programming Language
image/screenshot of info(optional)
Full Screen
Loading...

Suggested Answer

Answer
Full Screen
Copy Answer Code
Loading...