原书出处
Introduction to Algorithms, Fourth Edition
18 第18章 B树
t guard against deletion producing a tree whose structure violates the B-tree properties.
Just as a node should not get too big due to insertion, a node must not get too small during deletion (except that the root is allowed to have fewer than the minimum number t − 1 of keys).
And just as a simple insertion algorithm might have to back up if a node on the path to w
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter018.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea