The LCA Problem Revisited
- Cite this paper as:
- Bender M.A., Farach-Colton M. (2000) The LCA Problem Revisited. In: Gonnet G.H., Viola A. (eds) LATIN 2000: Theoretical Informatics. LATIN 2000. Lecture Notes in Computer Science, vol 1776. Springer, Berlin, Heidelberg
We present a very simple algorithm for the Least Common Ancestors problem. We thus dispel the frequently held notion that optimal LCA computation is unwieldy and unimplementable. Interestingly, this algorithm is a sequentialization of a previously known PRAM algorithm.
Unable to display preview. Download preview PDF.