← 返回卡片

原书出处

Introduction to Algorithms, Fourth Edition

18 第18章 B树

Fourth edition · 核验版本的摘录快照 · 导入于 2026-10-23T08:18:08.708Z

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