In a B-Tree, what is the minimum number of keys in a non-root node?
A. ⌈t/2⌉ - 1 where t is the minimum degree
B. ⌈t/2⌉
C. ⌈t/2⌉ + 1
D. t - 1
Answer: Option A
This Question Belongs to Data Structure >> Trees In Data Structures
Related Questions on Trees in Data Structures
A. Inorder
B. Preorder
C. Postorder
D. Level-order
Join The Discussion