GATE Exam | Aptitude Questions | GATE Syllabus | GATE Result | Mock Test | GATE Preparation
0 votes

B+ Trees are considered BALANCED because

A

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

B

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

C

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

D

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

asked in File organization, indexing (B and B+ trees) by gate

2 Answers

0 votes
A

the lengths of the paths from the root to all leaf nodes are all equal.
answered by gate
0 votes
Ravi teja
answered by A

Related questions

The best answer to any question