Question

Assume a B+-tree's node may contain up to 10 pointers, which of the following description about the B+-tree's nodes can not be true:

	A.	A leaf node has 4 search key values.
	B.	A leaf node has 5 search key values.
	C.	An internal node has 4 search key values.
	D.	An internal node has 5 search key values.

Answer 1

A B+ tree with maximum p pointers is of order p.

Thus, a node can have minimum ceil(p/2) children.

Also, B+ tree can have minimum ceil(p/2)-1 keys and maximum p-1 keys

Here p= 10.

Thus minimum no. Of keys= 4

Maximum no. Of keys= 9

Minimum children=5

Maximum children= 10

Leaf must contain atleast p/2 i.e 5 keys

Thus statement A i.e A leaf node has 4 search key values can not be true.