answersLogoWhite

0

One important property of a B-Tree is that every node except for the root node must have at least t-1 keys where t is the minimum degree of the B tree. With t-1 keys, each internal node will have at least t children [Cormen et al., Introduction To Algorithms Third Edition, MIT Press, 2009 p. 489].

If we allow a minimum degree of 1, then each internal node will have 1-1=0 keys!

User Avatar

Wiki User

11y ago

What else can I help you with?