原书出处
Introduction to Algorithms, Fourth Edition
18 第18章 B树
ed in the subtree with root x.ci, then k1 ≤ x.key1 ≤ k2 ≤ x.key2 ≤ ⋯ ≤ x.keyx.n ≤ kx.n+1.
All leaves have the same depth, which is the tree’s height h.
Nodes have lower and upper bounds on the number of keys they can contain, expressed in te
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter018.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea