Hopcroft 2-3 Tree ( Self-Balancing Trees Insertion)

From Algorithm Wiki

Revision as of 08:51, 10 April 2023 by Admin (talk | contribs)

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

Jump to navigation Jump to search

Time Complexity

$O(\log n)$

Space Complexity

$O({1})$ words

(Each node being changed requires constant auxiliary space to make changes; can reuse space across nodes being changed)

Description

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Word RAM

Year

1970

Reference

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