# Validate Binary Search Tree: Explained
Validate Binary Search Tree shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
DFS with a (low, high) window: a node must sit strictly between them, then left gets (low, node.val) and right gets (node.val, high).
## 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
Only comparing a node to its two children, which misses a deep violation like 5 / 1 / 6 / 4 / 7 / 3.
## 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.