recategorized by
3,017 views

1 Answer

2 votes
2 votes

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.

Answer:

Related questions

4 votes
4 votes
1 answer
1
2 votes
2 votes
3 answers
2
go_editor asked Aug 8, 2016
2,186 views
An ideal sort is an in-place-sort whose additional space requirement isO (log$_2$ n)O (nlog$_2$ n)O (1)O (n)
1 votes
1 votes
2 answers
4