Least You Need to Know: Lowest Common Ancestors and Path Intersections
Open lesson
The lowest common ancestor of two nodes is the **deepest node lying on both root-to-node paths**. LCA problems become easy once you think in terms of path overlap rather than arbitrary tree geometry.