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.