原书出处
Introduction to Algorithms, Fourth Edition
18 第18章 B树
Another common variant on a B-tree, known as a B*-tree, requires each internal node to be at least 2/3 full, rather than at least half full, as a B-tree requires.
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter018.xhtml#footnote_3
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea