Gate CS-2016-2 Question Paper With Solutions

Q. 31 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.

Answer: (A)

Explanation:

Gate CS-2016-2 Question Paper With Solutions

Learn More:   Gate ME-2019-2 Question Paper With Solutions

LEAVE A REPLY

Please enter your comment!
Please enter your name here