Guibas, Sedgewick Red-Black Tree ( Self-Balancing Trees Insertion)

From Algorithm Wiki

Revision as of 12:17, 15 February 2023 by Admin (talk | contribs) (Created page with "== Time Complexity == $O(logn)$ == Space Complexity == $O({1})$ words (^see above) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 1972 == Reference == https://ieeexplore.ieee.org/document/4567957")

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

Jump to navigation Jump to search

Time Complexity

$O(logn)$

Space Complexity

$O({1})$ words

(^see above)

Description

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Word RAM

Year

1972

Reference

https://ieeexplore.ieee.org/document/4567957

Retrieved from "https://algorithm-wiki.csail.mit.edu/w/index.php?title=Guibas,_Sedgewick_Red-Black_Tree_(_Self-Balancing_Trees_Insertion)&oldid=45525"