Fischer, Heun (Lowest Common Ancestor with Static Trees Lowest Common Ancestor)
Jump to navigation
Jump to search
Time Complexity
$O(m+n)$
Space Complexity
$O(n)$ words
(https://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.64.5439)
Description
Approximate?
Exact
Randomized?
No, deterministic
Model of Computation
Word RAM
Year
2006
Reference
https://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.64.5439