# Recover Binary Search Tree: Study Guide
Recover Binary Search Tree shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
Inorder should be sorted; the two nodes that break the increasing order are the swapped pair. Track prev and the first/second inversion, then swap their values.
## 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) extra O(1) with Morris.
## Common mistake
Swapping the nodes' whole subtrees instead of just the two values.
## 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 AI interview copilot.