5. The Lowest Common Ancestor Problem Given a tree and two nodes in the tree, find the lowest entry in the tree that is an ancestor to both. Applications: Computing Dominators in Flow Graphs Three-Way Merge Algorithms in Revision Control Common Word Roots/Suffixes Range-Min Query (RMQ) problems Computing Distance in a Tree … 6. The Lowest Common Ancestor Problem Given a tree and two nodes in the t
![Purely Functional Data Structures for On-Line LCA](https://cdn-ak-scissors.b.st-hatena.com/image/square/e9327c5fea1f6f69ea4025515eabdd51d2270e1b/height=288;version=1;width=512/https%3A%2F%2Fcdn.slidesharecdn.com%2Fss_thumbnails%2Fskew-binaryonlinelca-120531015027-phpapp02-thumbnail.jpg%3Fwidth%3D640%26height%3D640%26fit%3Dbounds)