Scapegoat Tree ( Self-Balancing Trees Insertion)

From Algorithm Wiki

Revision as of 11:18, 15 February 2023 by Admin (talk | contribs) (Created page with "== Time Complexity == $O(n)$ == Space Complexity == $O({1})$? words (^see above) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 1989 == Reference == https://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.138.4859")

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

Jump to navigation Jump to search

Time Complexity

$O(n)$

Space Complexity

$O({1})$? words

(^see above)

Description

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Word RAM

Year

1989

Reference

https://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.138.4859

Retrieved from "https://algorithm-wiki.csail.mit.edu/w/index.php?title=Scapegoat_Tree_(_Self-Balancing_Trees_Insertion)&oldid=45714"