Which of the following statement is false about a B-tree of order M?

DSSSB TGT/PGT · 2021 · PGT Computer Science (Female) · Section II: subject

1. A.

   The root has at least two child nodes and at most M child nodes.

2. B.

   The internal nodes except the root have atleast ⌈M/2⌉ child nodes.

3. C.

   Leaf nodes are not at the same level.

4. D.

   A node is full if it has (M – 1) keys.

Attempted by 36 students.