Discussion
B+ Trees are considered BALANCED because
Answer: A
B+ trees are balanced because the lengths of the paths from the root to all leaf nodes are all equal.
A B+ tree grows and shrinks only at the root: when a node overflows it splits and pushes a key up, and when the root splits the tree gains one level everywhere at once. So every leaf is always at the same depth, which guarantees \(O(\log n)\) search, insertion and deletion.
A difference of at most one in path length is the balance condition of an AVL tree, not a B+ tree. The numbers of children of sibling nodes, and of records in leaves, may differ by much more than one; they need only stay between the minimum (about half full) and the maximum fan-out.
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