why don't we allow a minimum degree of t=1? in B-tree
- 4 Answers
- 15290 Views
- TCS, I also Faced
- E-Mail Answers
Answer Posted / 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 |
Post New Answer View All Answers
Please Help Members By Posting Answers For Below Questions
No New Questions to Answer in this Category !! You can
Post New Questions
Answer Questions in Different Category
