Home » Programming & Data Structure » Programming and data structure miscellaneous » Question

Programming and data structure miscellaneous

Programming & Data Structure

  1. B+ Trees are considered BALANCED because
    1. the lengths of the paths from the root to all leaf nodes are all equal.
    2. the lengths of the paths from the root to all leaf nodes differ from each other by at most 1.
    3. the number of children of any two non-leaf sibling nodes differ by at most 1.
    4. the number of records in any two leaf nodes differ by at most 1.
Correct Option: A

In B and B+ trees, all the leaf nodes will be at same level.



Your comments will be displayed only after manual approval.