原书出处
Introduction to Algorithms, Fourth Edition
18 第18章 B树
s encountered during the recursion form a simple path downward from the root of the tree.
The B-TREE-SEARCH procedure therefore accesses O(h) = O(logt n) disk blocks, where h is the height of the B-tree and n is the number of keys in the B-tree. Since x.n < 2t, the while loop of lines 2–3 takes O(t) time within each node, and the total CPU time is O(th) = O(t logtn).
Creating an empty B-tree To build a B-tree T, first use the B-TREE-CREATE procedure on th
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter018.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea