Q101
What is the best case height of a B-tree of order n and which has k keys?
A.
logn (k+1) - 1
AnswerB.
nk
C.
logk (n+1) - 1
D.
klogn
Answer: Option A
Solution
Answer: Option A
No explanation is given for this question Let's Discuss on Board