# BST Iterator: Interview Notes
BST Iterator shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
Push the leftmost spine onto a stack; next() pops, then pushes the leftmost spine of the popped node's right child. hasNext is whether the stack is non-empty.
## 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(1) amortized, O(h) space.
## Common mistake
Flattening the whole inorder list up front, which the follow-up asks you not to do.
## 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 Linkjob AI interview assistant.