Question

Insert the following key into B-tree of order 5, 20, 30,

85, 35, 10, 55, 60, 25, 5, 65, 70, 75​

Answer 1

Explanation:

1. If the tree is empty , allocate a root node and insert the key .
2. Update the allowed number of keys in the node.
3. Search the appropriate note for insertion.
4. If the node is, full follow the steps below.
5. Insert the elements in increasing order.
6. Now, there are elements greater than its limit.