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

From Algorithm Wiki
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