"Mergeable Trees"

Robert E. Tarjan, Princeton University

I shall discuss data structures for representing heap-ordered trees so that efficiently nearest common ancestor queries and path-merging updates are efficient. Such a data structure is required as a subroutine in a method for determining the structure of a 2D manifold in 3-space.