Modified van Leeuwen (Static Trees) (Lowest Common Ancestor with Static Trees Lowest Common Ancestor)

From Algorithm Wiki
Jump to navigation Jump to search

Time Complexity

$O(n+m*log(log(n)$))

Space Complexity

$O(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

Reference

(Unpublished report)