# Lowest Common Ancestor Of A BST: Explained
Lowest Common Ancestor Of A BST shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
Walk from the root: if both p and q are smaller go left, if both are larger go right, otherwise the current node splits them and is the LCA.
## 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(h).
## Common mistake
Doing a full binary-tree LCA search and ignoring the BST order.
## 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 tool for job interviews.