# Lowest Common Ancestor Of A Binary Tree IV: Explained
Lowest Common Ancestor Of A Binary Tree IV shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
Find the LCA of a list of nodes that are guaranteed to be in the tree. The same postorder idea: a node is the answer if the number of target-hits in its subtree equals the number of queries and no child already covers them all. Put targets in a set and DFS.
## 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(n).
## Common mistake
Reducing only a pair at a time without arguing associativity, or requiring the nodes to be leaves.
## 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.