Vidyalelo
Data Structure · Q33

Advanced Trees (AVL, RedBlack, BTrees)

Programming · Data Structure · question 33

Q33

Which of the following is true about the root node in a B-Tree?

A.
It can have fewer than the minimum number of children.
Answer
B.
It must have exactly m children.
C.
It must be a leaf.
D.
It cannot have more than m children.

Answer: Option A

Solution

Answer: Option A
No explanation is given for this question Let's Discuss on Board