Consider a B+ tree in which the maximum number of keys in

Home » Database » Database miscellaneous » Question

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 nonroot node?

1. 1
2. 2
3. 3
4. 4

Correct Option: B

In B⁺ tree, the root node has minimum 2 block pointers and maximum P block pointer where, P = order where, key = order – 1 and in the non-root node, the minimum number of keys

=		P		- 1
		2

So, in the question key = 5, order = 6
So, minimum number of keys in non-root node

=		6		- 1 = 2
		2