Purely Functional Data Structures for On-Line LCAThe document discusses the Lowest Common Ancestor (LCA) problem, which involves finding the lowest node in a tree that is an ancestor to two given nodes. It reviews various algorithms and data structures for both offline and online solutions, including improvements by notable researchers over the years. The paper also presents a new approach using skew-binary random access lists to enhance the eff
