Aho, Hopcroft, and Ullman (Linking) (Lowest Common Ancestor with Linking Lowest Common Ancestor)
Jump to navigation
Jump to search
Time Complexity
$O((m+n)$*log(n))
Space Complexity
$O(n*log(n)$) words
(https://www.cs.bgu.ac.il/~segal/PAPERS2/tarj.pdf)
Description
Approximate?
Exact
Randomized?
No, deterministic
Model of Computation
Word RAM
Year
1976