← 返回卡片

原书出处

Introduction to Algorithms, Fourth Edition

18 第18章 B树

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

. A new node s (with two children) becomes the root and is returned by B-TREE-SPLIT-ROOT.

Splitting the root, illustrated in Figure 18.6, is the only way to increase the height of a B-tree. Unlike a binary search tree, a B-tree increases in height at the top instead of at the bottom.

Regardless of whether the root split, B-TREE-INSERT finishes by calling B-TREE-INSERT-NON

此预览只包含定位所需的摘录和上下文。

原书定位详情

来源:a19c7933-4eda-4176-aebd-30fe7e1ad292

正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter018.xhtml

EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea