← GATE CSE 2010

Q18

MCQ1 mark, −0.33

Consider a $B^+$ -tree in which the maximum number of keys in a node is $5$ . What is the minimum number of keys in any non-root node?

(A)

$1$

(B)

$2$

(C)

$3$

(D)

$4$

Sign in to save attempts.

Loading…