ISRO | ISRO CS 2015 | Question 39

If a node has K children in Btree, then the node contains exactly _____ keys.
(A) K²
(B) K – 1
(C) K + 1
(D) K^1/2


Answer: (B)

Explanation: In a B-tree, if a node contains n keys then it has n+1 child pointers. So, if it has K children (child pointers) then it should have K-1 keys.

Quiz of this Question
Please comment below if you find anything wrong in the above post