# Lowest Common Ancestor Of A Binary Tree III: Walkthrough

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

## Key idea

Nodes have parent pointers: walk up from both, or two-pointer like intersecting lists.

## Steps to say out loud

1. Restate the input and the exact ask, and nail down constraints and overflow.
2. Name the pattern (graph BFS/DFS, union-find, topological sort, or tree 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

Using a root-based LCA when the problem gives no root, only parents.

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