Bayer, McCreight B-Tree ( Self-Balancing Trees Creation)

From Algorithm Wiki
Revision as of 09: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(n*b*\log(n)$/\log(b))?

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