# Lowest Common Ancestor Of A Binary Tree: Interview Notes

Lowest Common Ancestor Of A Binary Tree shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.

## Key idea

DFS: if the current node is p or q, return it; otherwise recurse both sides and the first node that sees a hit on both sides 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(n).

## Common mistake

Walking parent pointers that do not exist in this problem, or returning a node that only covers one target.

## 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.