Lowest Common Ancestor with Linking Roots: Revision history

Jump to navigation Jump to search

Diff selection: Mark the radio buttons of the revisions to compare and hit enter or the button at the bottom.
Legend: (cur) = difference with latest revision, (prev) = difference with preceding revision, m = minor edit.

28 April 2023

15 February 2023

  • curprev 10:2210:22, 15 February 2023‎ Admin talk contribs‎ 1,821 bytes +1,821‎ Created page with "{{DISPLAYTITLE:Lowest Common Ancestor with Linking Roots (Lowest Common Ancestor)}} == Description == Given a collection of rooted trees, answer queries of the form, "What is the nearest common ancestor of vertices $x$ and $y$?" In this version of the problem, The queries are given on-line. Interspersed with the queries are on-line commands of the form $link(x, y)$ where $x$ and $y$ are tree roots. The effect of a command $link(x, y)$ is to combine the trees containing..."
Retrieved from "https://algorithm-wiki.csail.mit.edu/wiki/Lowest_Common_Ancestor_with_Linking_Roots"