Worst-Case Search Depth I
Given 1,000,000 keys and a B-Tree of order 512, what is the maximum number of disk accesses necessary to locate a key in the tree? In other words, how deep will the tree be?
Each key appears in the leaf ==> What is the maximum height of a tree with 1,000,000 leaves?
The maximum height will be reached if all pages (or nodes) in the tree has the minimum allowed number of descendents
For a B-Tree of order m, the minimum number of descendents from the root page is 2. It is ?m/2? for all the . other pages.