If a B-tree of order 5 contains the key values 20,40,50,60,80,90 and 100,and the root contains only the key value 60,then deleting the key 20 will require us to merge the two child nodes.

Question

Quizplus · Accepted Answer

In a B-tree of order 5, each node can have a minimum of 2 keys and a maximum of 4 keys. Deleting the key 20 from a child node that already has the minimum number of keys (2 keys in this case) would indeed require adjustments. However, without knowing the exact distribution of the keys across the nodes, we cannot definitively say that it will require merging the two child nodes. It's possible that a redistribution of keys among siblings or borrowing a key from an adjacent sibling could suffice, depending on the tree's structure.

If a B-Tree of Order 5 Contains the Key Values