Question:-
79. let T be a B-tree of order m and height h. If n is the no of key elements in T then the max value of n is :
Option (A)
(m-1)h -1
Option (B)
(m-1)h-1 +1
Option(C)
mh -1
Option(D)
mh-1 +1
Correct Option:
()
question-answer-faq-2478