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? (GATE CS 2010)
(A)
1
(B)
2
(C)
3
(D)
4
Answer: (B)
Explanation:
Since the maximum number of keys is 5, maximum number of children a node can have is 6. By definition of B Tree, minimum children that a node can have would be 6/2 -1 = 2.
Quiz of this Question
Please comment below if you find anything wrong in the above post