Vidyalelo
Data Structure · Q57

Advanced Trees (AVL, RedBlack, BTrees)

Programming · Data Structure · question 57

Q57

A B-tree of order 4 and of height 3 will have a maximum of . . . . . . . . keys.

A.
255
Answer
B.
63
C.
127
D.
188

Answer: Option A

Solution

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