原书出处
Introduction to Algorithms, Fourth Edition
18 第18章 B树
, expressed in terms of a fixed integer t ≥ 2 called the minimum degree of the B-tree: a.
Every node other than the root must have at least t − 1 keys. Every internal node other than the root thus has at least t children. If the tree is nonempty, the root must have at least one key. b. Every node may contain at most 2t − 1 keys. Therefore, an internal node may have at most 2t children.
We say that a node is full if it contains exactly 2t − 1 keys.3 The simplest B-tree occur
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter018.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea