# BST Iterator II: Explained
BST Iterator II shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
A BST iterator that supports next, hasNext, prev, and hasPrev. Keep an inorder list (or a stack plus a visited prefix) and a pointer; expand the right side on demand if you record already-yielded nodes.
## Steps to say out loud
1. Restate the input and the exact ask, and nail down constraints and overflow.
2. Name the pattern (binary search on the answer, monotonic stack or deque, interval / interval-DP, string hashing, graph traversal, or shortest paths) and why a nested scan or naive search fails.
3. Code it, then trace a short example plus one empty or already-solved edge case.
## Complexity
O(1) amortized next/prev after O(n) prep, or O(h) with a stack.
## Common mistake
Only storing a next-stack and being unable to walk prev without parent pointers or a history.
## 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 www.linkjob.ai.