原书出处
Introduction to Algorithms, Fourth Edition
18 第18章 B树
l at depth h, it has at least 2th−1 nodes. Figure 18.4 illustrates such a tree for h = 3.
The number n of keys therefore satisfies the inequality so that th ≤ (n + 1)/2. Taking base-t logarithms of both sides proves the theorem.
▪ You can see the power of B-trees as compared with red-black trees. Although the height
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter018.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea