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

1
A node is full if it has (M - 1) keys. 
2
The internal nodes except the root have atleast \(\lceil \frac{M}{2}\rceil\) child notdes.
3
The root has at least two child nodes and at most M child nodes.
4
Leaf nodes are not at the same level.
5
All of above

Sponsored

hivanix.in

Visit

This quiz is brought to you by hivanix.in

🌐 Web App Development

Quick Navigation