# Convert BST To Greater Tree: Interview Notes

Convert BST To Greater Tree shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.

## Key idea

Reverse inorder (right, node, left) while accumulating a running sum, and set each node's value to that sum (itself plus all greater keys).

## Steps to say out loud

1. Restate the input and the exact ask, and nail down constraints and overflow.
2. Name the pattern (tree DFS, BST walk, or subtree DP) and why a simpler scan fails.
3. Code it, then trace a short example plus one empty or already-solved edge case.

## Complexity

O(n).

## Common mistake

Adding only the immediate right child instead of the whole greater set.

## Practice tip

Time yourself: two minutes to explain, ten to code, three to test edges. Disclosure: I work on Linkjob AI. I also keep a practice cheat sheet at this tool.