原书出处
Introduction to Algorithms, Fourth Edition
18 第18章 B树
sert the new key, and thus you could end up splitting full nodes all the way up the tree.
To avoid having to go back up the tree, just split every full node you encounter as you go down the tree. In this way, whenever you need to split a full node, you are assured that its parent is not full.
Inserting a key into a B-tree then requires only a single pass down the tree from the roo
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter018.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea