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 are the stages of software system engineering process?
How to Design a Good Newsletter?
What feature of the waterfall model distinguishes it from other models
vb.net with Sql sever2005
What is an authoring tool?
In a 100 day project how much time would be spent on requirements capture.
What, if anything, is the difference between "executing" a processing instructions and "processing" a processing instruction? Are the terms "executing" and "processing" interchangeable?
Ford Software engineer interview process and model questions
What is the role of the W3C in Web accessibility?
what is another name for Spiral SDLC?
What's the Difference Between a Dummy and a Comp?
What makes virtual platforms a powerful tool for software development?