Discussion
Which operation benefits most dramatically from the linked leaf nodes in a B+ tree ?
Answer: B
The operation that benefits most is successor lookup.
In a B+ tree all keys sit in the leaves, and the leaves are chained by pointers in key order. Once a key has been found, its successor (the next larger key) is either next in the same leaf or the first key of the next leaf, reached in one step through the link instead of a new walk from the root. That is why range scans and ordered traversal are fast in B+ trees.
An exact key search still goes from the root to a leaf, so the links do not help it. Parent node splitting and structural rebalancing are insertion and deletion mechanics on the internal levels and do not use the leaf chain.
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