GATE | IT | 2005 | data structures | Tree | Question 23

Last Updated :
Discuss
Comments
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:

5

4

3

2

This question is part of this quiz :

Top MCQs on B and B+ Trees with Answers,Gate IT 2005
Tags:
DSA Quiz
GATE
Share your thoughts in the comments