B+ Trees are considered BALANCED because

GATE · 2016 · CS · Set 2 · Computer Science & IT

1. A.

   the lengths of the paths from the root to all leaf nodes are all equal.

2. B.

   the lengths of the paths from the root to all leaf nodes differ from each other by at most 1.

3. C.

   the number of children of any two non-leaf sibling nodes differ by at most 1.

4. D.

   the number of records in any two leaf nodes differ by at most 1.

Attempted by 638 students.