Discussion
The maximum number of children that a B-tree of order m can have :
Answer: C
A B-tree of order m has at most m children per node.
In the usual (Knuth) definition, the order is the maximum number of children. Each node then holds at most m - 1 keys, and every internal node other than the root has at least \(\lceil m/2 \rceil\) children.
m - 1 is the maximum number of keys, not children. m + 1 and 2m exceed the definition, though 2m appears in the older convention in which 'order' means the minimum degree.
No comment is present. Be the first to comment.
Loading…
Post your comment
Please log in or register to post a comment.
Examination Categories
- SSC Exams
- Banking Exams
- Teaching Exams
- Civil Services Exams
- Railways Exams
- Engineering Recruitment Exams
- Defence Exams
- State Government Exams
- Police Exams
- Insurance Exams
- Nursing Exams
- Other Government Exams
- NRA CET
- PG Entrance Exams
- Campus Placement
- MBA Entrance Exams
- CUET and UG Entrance
- Judiciary Exams
- Regulatory Body Exams
- Software Development