Every internal node in a B-tree of minimum degree 2 can have
A. 2, 3 or 4 children
B. 1, 2 or 3 children
C. 2, 4 or 6 children
D. 0, 2 or 4 children
Answer:B
Every internal node in a B-tree of minimum degree 2 can have
A. 2, 3 or 4 children B. 1, 2 or 3 children C. 2, 4 or 6 children D. 0, 2 or 4 children