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

From Algorithm Wiki
Revision as of 12:18, 15 February 2023 by Admin (talk | contribs) (Created page with "== Time Complexity == $O(b*log(n)$/log(b))? == Space Complexity == $O({1})$ words (^see above) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 1970 == Reference ==")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

Time Complexity

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

Space Complexity

$O({1})$ words

(^see above)

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=Bayer,_McCreight_B-Tree_(_Self-Balancing_Trees_Search)&oldid=45723"