原书出处
Introduction to Algorithms, Fourth Edition
18 第18章 B树
Introduction to Algorithms 18 B-Trees
B-trees are balanced search trees designed to work well on disk drives or other direct-access secondary storage devices.
B-trees are similar to red-black trees (Chapter 13), but they are better at minimizing th
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter018.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea