Discussion
In a B-tree the number of keys in each node is ______ than the number of its children.
Answer: A
Correct answer: one less
In a B-tree the keys in a node separate the ranges covered by its children, so n keys divide the range into \( n+1 \) intervals and the node has \( n+1 \) children. The number of keys is therefore one less than the number of children.
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