Which of the following statement is false about a B-tree of order M?
2021
Which of the following statement is false about a B-tree of order M?
- A.
The root is either a leaf node or has at least two child nodes and at most M child nodes.
- B.
The internal nodes except the root have at least ⌈M/2⌉ child nodes.
- C.
Leaf nodes are not at the same level.
- D.
A node is full if it has (M − 1) keys.
Attempted by 233 students.
Show answer & explanation
Correct answer: C
In a B-tree of order M, the root is a special case: it is either a leaf node, or if it is not a leaf, it has at least two children and at most M children.
Internal nodes except the root have at least ceil(M/2) children, and a full node can contain M - 1 keys.
The false statement is: "Leaf nodes are not at the same level."
This is false because all leaf nodes in a B-tree must be at the same level. This property keeps the B-tree height-balanced.