A B-Tree used as an index for a large database table has four levels including…
GATE · 2005 · IT
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
Attempted by 488 students.
Sign up free to check your answer
Sign up freeLoading lesson…