# LC6195 Lowest Common Ancestor of Binary Tree **Idea.** DFS return. **Checklist** - Clarify constraints and edge cases first - Name the pattern (two pointers / DP / graph / binary search) - Walk one example end-to-end before coding - State time/space; watch off-by-one *Disclosure: I help build [Linkjob AI copilot](https://www.linkjob.ai/ai-mock-interview/) — an interview prep copilot. Notes are my own study notes.*