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

Still curious? Ask our experts.

Chat with our AI personalities

JordanJordan
Looking for a career mentor? I've seen my fair share of shake-ups.
Chat with Jordan
FranFran
I've made my fair share of mistakes, and if I can help you avoid a few, I'd sure like to try.
Chat with Fran
EzraEzra
Faith is not about having all the answers, but learning to ask the right questions.
Chat with Ezra

Add your answer:

Earn +20 pts
Q: Why don't we allow a minimum degree of B-Tree is 1?
Write your answer...
Submit
Still have questions?
magnify glass
imp