Section Recap

You learned three ways to find the Lowest Common Ancestor: the naive climb-together method, binary lifting for $O(\log n)$ queries, and Euler tour + RMQ for $O(1)$ queries. You used LCA to compute distances, count paths, and answer range queries on tree paths.

You solved three problems: LCA of a Binary Tree, Distance Queries, and Counting Paths. Next section: advanced tree techniques like centroid decomposition and heavy-light decomposition.