原书出处
Introduction to Algorithms, Fourth Edition
18 第18章 B树
moving a key from x down into the new merged node to become the median key for that node.
In cases 2c and 3b, if node x is the root, it could end up having no keys. When this situation occurs, then x is deleted, and x’s only child x.c1 becomes the new root of the tree. This action decreases the height of the tree by one and preserves the property that the root of the tree contains at least one key (unless the tree is empty).
Since most of the keys in a B-tree are in the leaves, deletion operations often end up de
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter018.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea