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

From Algorithm Wiki

Jump to navigation Jump to search

Time Complexity

$O(b*log(n)$/log(b))?

Space Complexity

$O(b)$? words

(^see above, but with branching factor involved)

Description

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Word RAM

Year

1970

Reference

Retrieved from "https://algorithm-wiki-csail-mit-edu.ezproxy.canberra.edu.au/w/index.php?title=Bayer,_McCreight_B-Tree_(_Self-Balancing_Trees_Insertion)&oldid=45713"