Module Lowest common ancestor (LCA)

Lowest common ancestor (LCA)

**Frequency: 8/10** In many cases where a problem involves querying a path on a tree, there is a high likelihood that the Lowest Common Ancestor (LCA) will be a crucial element in the solution. There are also a lot of problems involving LCA in the next module, Euler tour.

Resources

- [CP Algorithms: Lowest Common Ancestor - Binary Lifting](https://cp-algorithms.com/graph/lca_binary_lifting.html)

Problems

LCA 388 / 393 1300
Distance query 341 / 350 1400
Robot on tree 282 / 304 1400
Heaviest edge 264 / 270 1500
Equal path 209 / 220 1500
Triplet 179 / 183 1500
Path update 201 / 206 1600
Second best minimum spanning tree 94 / 163 1700
Oggy and the cockroaches 32 / 47 1800