Kmett (Lowest Common Ancestor with Static Trees Lowest Common Ancestor)

From Algorithm Wiki

Revision as of 12:18, 15 February 2023 by Admin (talk | contribs) (Created page with "== Time Complexity == $O(m*log(h)$) == Space Complexity == words () == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 2015 == Reference == https://www.schoolofhaskell.com/user/edwardk/online-lca")

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Jump to navigation Jump to search

Time Complexity

$O(m*log(h)$)

Space Complexity

words

()

Description

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Word RAM

Year

2015

Reference

https://www.schoolofhaskell.com/user/edwardk/online-lca

Retrieved from "https://algorithm-wiki.csail.mit.edu/w/index.php?title=Kmett_(Lowest_Common_Ancestor_with_Static_Trees_Lowest_Common_Ancestor)&oldid=45671"