Consider a B⁺- tree in which the maximum number of keys in a node is 5. What is the minimum number of keys in any non-root node?

A clustering index is defined on the fields which are of type

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:

B⁺-trees are preferred to binary trees in databases because