原书出处
Introduction to Algorithms, Fourth Edition
18 第18章 B树
at internal node x. Lines 9–11 determine the child x.ci to which the recursion descends.
Line 13 detects whether the recursion would descend to a full child, in which case line 14 calls B-TREE-SPLIT-CHILD to split that child into two nonfull children, and lines 15–16 determine which of the two children is the correct one to descend to.
(Note that DISK-READ(x.ci) is not needed after line 16 increments i, since the recursion
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter018.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea