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

From Algorithm Wiki
Jump to navigation Jump to search

Time Complexity

$O(n \log n)$

Space Complexity

$O(n)$ words

(Need to keep track of intermediary stages of tree before outputting)

Description

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Word RAM

Year

1970

Reference