Multiple choice

Which of the following is not correct about a B-tree?

  1. In a B-tree, each non-leaf node has a maximum of M children keys.

  2. Each node has one fewer key than the number of children with a maximum of M-1 keys.

  3. In a B-tree, each non-leaf node has a minimum of M/2 keys.

  4. In a B-tree, all leaves are not on the same level.

  5. It is also called a balanced m-way search tree.
Reveal answer Fill a bubble to check yourself
D Correct answer
Explanation

It is an incorrect statement about B-tree. In a B-tree, all leaves are on the same level.

Keep practicing — related questions