1. Computer Science Engineering (CSE)
  2. Data Structures (DS)
  3. Non Linear Data Structures - Trees
  4. What is the best case height of a B-tree...
Q.

What is the best case height of a B-tree of order n and which has k keys?

A. logn (k+1) – 1
B. nk
C. logk (n+1) – 1
D. klogn
Answer» A. logn (k+1) – 1
View all MCQs in:   Data Structures (DS)

Discussion