原书出处
Introduction to Algorithms, Fourth Edition
18 第18章 B树
t sibling up into x, and moving the appropriate child pointer from the sibling into x.ci.
Case 3b: x.ci and each of x.ci’s immediate siblings have t − 1 keys. (It is possible for x.ci to have either one or two siblings.) Merge x.ci with one sibling, which involves 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 situ
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter018.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea