Aho, Hopcroft, and Ullman (Static Trees) (Lowest Common Ancestor with Static Trees Lowest Common Ancestor)
Jump to navigation
Jump to search
Time Complexity
$O((m+n)$*log(log(n)))
Space Complexity
$O(n*log(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