原书出处
Introduction to Algorithms, Fourth Edition
18 第18章 B树
keys in x.ci (the child of x that precedes k) and x.ci+1 (the child of x that follows k).
Case 2a: x.ci has at least t keys. Find the predecessor k′ of k in the subtree rooted at x.ci. Recursively delete k′ from x.ci, and replace k by k′ in x. (Key k′ can be found and deleted in a single downward pass.)
Case 2b: x.ci has t − 1 keys and x.ci+1has at least t keys. This case is symmetric to cas
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter018.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea