A B-Tree used as an index for a large database table has four levels including…
2017
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
Answer: A. 5 — In a B-Tree with four levels, inserting a key can trigger node splits propagating from the leaf up to the root. In the worst case, every level along the path…
- A.
5
- B.
4
- C.
1
- D.
2
Attempted by 393 students.
Show answer & explanation
Correct answer: A
In a B-Tree with four levels, inserting a key can trigger node splits propagating from the leaf up to the root. In the worst case, every level along the path splits. For the three levels below the root, each split creates one new sibling node (3 nodes). When the root splits, it generates two new nodes to accommodate the split and a new root. Total newly created nodes = 3 + 2 = 5.
A video solution is available for this question — log in and enroll to watch it.
Explore the full course: Iocl Engineers Officers Grade A Paper 2