why don't we allow a minimum degree of t=1? in B-tree
- 4 Answers
- 15288 Views
- TCS, I also Faced
- E-Mail Answers
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 called when you add pixels to a rastered image when you resize?
What is the difference between a web-based and installed software?
what are the process colors? what is the space between letters called? what is the space between spaces called?
What's the Difference Between a Dummy and a Comp?
. What is a Design System?
How can authoring tools support the production of accessible Web content?
Explain how object-oriented analysis and design differ from the traditional approach.
what do you mean by Foreign exchange domain
What are the Rules of Desktop Publishing?
How to Design a Good Newsletter?
What feature of the waterfall model distinguishes it from other models
What was the architecture or design of your last project? what were the pros and cons of the design?did it scale well?
Design Patterns 
