Discussion
Which of the following best explains why B+ trees typically have smaller height than B-trees ?
Answer: B
The reason is that internal nodes store only keys, allowing higher fan-out.
In a B-tree, every node holds keys together with their records or record pointers. In a B+ tree, the internal nodes hold only keys and child pointers, and all data lives in the leaves. A disk block of fixed size can therefore hold many more entries in a B+ tree internal node, so each node has more children, and a tree with a higher fan-out reaches the same number of keys in fewer levels.
B+ trees do not use hashing. Sequentially linked leaves speed up range scans but do not reduce height. Whether duplicates are allowed has no effect on the height.
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