UTpaper

Free mock tests & test series

Question 59

A B-Tree is of order p and consists of n keys. Its maximum height is

  1. Alog_(p/2) (n+1)/2
  2. Blog_p n
  3. Clog_(p/2) (n+1)
  4. DNone of the above
Show answerHide answer

Correct answer: (A) log_(p/2) (n+1)/2

Explanation

In a B-tree of order p, every non-root node has at least ⌈p/2⌉ children. So the maximum height is log base ⌈p/2⌉ of (n+1)/2.

From DSSSB TGT Computer Science Practice Set 2

This is question 59 of DSSSB TGT Computer Science Practice Set 2. See all questions of this paper with answers, or attempt the paper as a timed online test to get your score and all-India rank.