Discussion
Some differences between B tree and B+ tree approaches are :
(i) In a B tree, search keys and data are stored in internal or leaf nodes. But, in B+ tree, data are stored only in leaf nodes.
(ii) A link is maintained among all the nodes so that one can move from the left-most node to right-most node in B+ tree.
Answer: C
Both (i) and (ii) are correct.
In a B tree, keys and their data (or record pointers) are stored in internal nodes as well as leaves. In a B+ tree, internal nodes hold only keys to guide the search, and all data lives in the leaves (i).
The leaves of a B+ tree are also linked together in key order, so after reaching the left-most leaf one can scan sequentially to the right-most, which makes range queries efficient (ii). So neither statement alone is the full picture.
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