Computer Sciences > Gate 2016 Set-2 > B+ Tree

Contributed by: Dr. Sarah Chen

Report Correct Copyright Claim

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.

Check Answer

Explanation

Correct : B+ Tree

Similar Questions

What is the worst-case time complexity of insertion in an AVL tree?

Question #23 Medium

Which operations on a binary search tree have O(h) complexity?

Question #31 Easy

Compare search complexities of sorted array vs balanced BST.

Question #47 Hard

Related Topics

Data Structures Binary Search Tree Time Complexity Algorithm Analysis Tree Algorithms Computer Science