原书出处
Introduction to Algorithms, Fourth Edition
18 第18章 B树
on of B, which is case 3a: C moves to fill B’s position and E moves to fill C’s position.
Case 1: The search arrives at a leaf node x. If x contains key k, then delete k from x. If x does not contain key k, then k was not in the B-tree and nothing else needs to be done.
Case 2: The search arrives at an internal node x that contains key k. Let k = x.keyi. One
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter018.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea