Leetcode Problem 1038. Binary Search Tree to Greater Sum Tree

1038. Binary Search Tree to Greater Sum Tree

Leetcode Solutions

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

Programming Language

Purpose:

General Question

Debug My Code

image/screenshot of info(optional)

Full Screen