The number of disk pages access in B-tree search, where h is height, n is the number of keys and t is the minimum degree, is
The number of disk pages accessed by B-TREE-SEARCH is Θ(h) =Θ(logt n), where h is the height of the B-tree and n is the number of keys in the B-tree.
Hence, Option 4 is correct.
64.3k questions
77.9k answers
244k comments
80.0k users