原书出处
Introduction to Algorithms, Fourth Edition
18 第18章 B树
ld fail to be a valid B-tree. Instead, you insert the new key into an existing leaf node.
Since you cannot insert a key into a leaf node that is full, you need an operation that splits a full node y (having 2t − 1 keys) around its median key y.keyt into two nodes having only t − 1 keys each. The median key moves up into y’s parent to identify the dividing point between the two new trees.
But if y’s parent is also full, you must split it before you can insert the new key, and
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter018.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea