# Lowest Common Ancestor of a Binary Tree (Practice 5037): Brief Interviewers use this pattern to test whether you can state the invariant before coding. Here is a compact rehearsal note. ## Approach Return the node if it matches p or q; a node whose two children both return non-null is the LCA. ```python def lca(root,p,q): if not root or root in (p,q): return root l=lca(root.left,p,q);r=lca(root.right,p,q) return root if l and r else l or r ``` ## Complexity Linear in the dominant input size for the scan; heap/tree variants add a log factor. ## Interview pitfalls State the invariant out loud, name the complexity, then code. Skipping the invariant is the usual fail mode. ## Practicing out loud Narrate the approach, complexity and one edge case in under a minute. Disclosure: I work on Linkjob AI, a real-time interview assistant. If you want live practice help, see [AI tool for job interviews](https://www.linkjob.ai/).