GATE | Gate IT 2005 | Question 23

A B-Tree used as an index for a large database table has four levels including the root node. If a new key is inserted in this index, then the maximum number of nodes that could be newly created in the process are:

(A) 5
(B) 4
(C) 3
(D) 2

Answer: (A)

Explanation: Number of children of a node is equal to the number of keys in it plus 1.

Given tree has 4 levels, the tree will be increased with one more level if a new key is inserted.

Quiz of this Question

My Personal Notes arrow_drop_up
Article Tags :

Be the First to upvote.

Please write to us at to report any issue with the above content.