Skip to content
Related Articles

Related Articles

UGC-NET | UGC NET CS 2015 Dec – II | Question 37

View Discussion
Improve Article
Save Article
  • Last Updated : 01 May, 2018

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:
(A) θ(logn h * t)
(B) θ(logt n * h)
(C) θ(logh n)
(D) θ(logt n)

Answer: (D)


Quiz of this Question
Please comment below if you find anything wrong in the above post

My Personal Notes arrow_drop_up
Recommended Articles
Page :

Start Your Coding Journey Now!