Skip to content
Related Articles

Related Articles

Improve Article
Data Structures | B and B+ Trees | Question 3
  • Last Updated : 22 Feb, 2013

B+ trees are preferred to binary trees in databases because (GATE CS 2000)
(A) Disk capacities are greater than memory capacities
(B) Disk access is much slower than memory access
(C) Disk data transfer rates are much less than memory data transfer rates
(D) Disks are more reliable than memory

Answer: (B)

Explanation: Disk access is slow and  B+ Tree provide search in less number of disk hits. This is primarily because unlike binary seach trees, B+ trees have very high fanout (typically on the order of 100 or more), which reduces the number of I/O operations required to find an element in the tree.

Quiz of this Question

My Personal Notes arrow_drop_up
Recommended Articles
Page :