原书出处
Introduction to Algorithms, Fourth Edition
18 第18章 B树
ace k by k′ in x. (Again, finding and deleting k′ can be done in a single downward pass.)
Case 2c: Both x.ci and x.ci+1have t − 1 keys. Merge k and all of x.ci+1 into x.ci, so that x loses both k and the pointer to x.ci+1, and x.ci now contains 2t − 1 keys. Then free x.ci+1 and recursively delete k from x.ci.
Case 3: The search arrives at an internal node x that does not contain key k. Continue se
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter018.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea