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 |
what is another name for Spiral SDLC?
Ford Software engineer interview process and model questions
What has been your most successful project?
What is the difference between a web-based and installed software?
what are the stages of software system engineering process?
what is the difference between generic process model & iterative process model??
How would you create a footprint in your PCB designer software (say, Altium)?
What are the Rules of Desktop Publishing?
How to Design a Good Ad?
why don't we allow a minimum degree of t=1? in B-tree
vendor out going payment suppose is 10000/- and after some time vendor returned 2000/- as it is excess where this transaction to be posted in fi/ap
discuss about cmmi model capability