Discussion
In a B+ tree, actual data is stored in
Answer: C
In a B+ tree, actual data is stored in the leaf nodes.
A B+ tree keeps all records, or pointers to them, in its leaves, and links the leaves together in key order. The internal nodes hold only copies of keys to guide the search, so every search ends at a leaf, and a range of keys can be read by walking along the leaf chain.
This is the main difference from a B-tree, where data can sit in any node. The root, internal and parent nodes of a B+ tree are all index levels that hold keys and child pointers only.
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