why don't we allow a minimum degree of t=1? in B-tree
Answers were Sorted based on User's Feedback
Answer / chanu
Minimum degree =t => Minimum t-1 keys , Maximum 2t-1 keys
=> Minimum t child , Maximum 2t child
so,
Minimum degree =1 => Minimum 0 keys , Maximum 1 key
=> Minimum 1 child , Maximum 2 child
Minimum case doesn't exist i.e., no node exists with o keys and no node with only 1 child exists because a node with 1 key has 2 child .......
| Is This Answer Correct ? | 20 Yes | 2 No |
Answer / mac
Because then we've a node with no keys and that is according
to the definition of B-tree.
| Is This Answer Correct ? | 15 Yes | 4 No |
Answer / nikhil joshi
Suppose We have degree=1, then min keys are 0 and max are 1, means min children are 1 and max are 2. then it will behave like binary tree then why do we need b-tree. but also every node must have a key.
| Is This Answer Correct ? | 0 Yes | 0 No |
Answer / preeti singh
because b-tree has two child and the degree of b-tree is 2.
| Is This Answer Correct ? | 4 Yes | 9 No |
which is the better institute for software design in bangalore please tell me as soon a possible?
How to Design a Good Newsletter?
What are the best tools available now for creation of accessible Web sites?
What is an authoring tool?
What is the difference between a web-based and installed software?
what are the differences between system fresh and client fresh in SAP?
what is fact finding methods
discuss about cmmi model capability
In a 100 day project how much time would be spent on requirements capture.
What is Make to Order, and what is the difference between Make to order and Make to Cash
Write a command to find all of the files which have been accessed within the last 30 days. Output should be stored in a file “December.files”
why is testing neccessary?