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 search 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
Ready to dive in? Explore our Free Demo Content and join our DSA course, trusted by over 100,000 neveropen!

… [Trackback]
[…] There you can find 9414 more Info to that Topic: geeksforgeeks.org/data-structures-b-and-b-trees-question-3-2/ […]
… [Trackback]
[…] There you will find 97119 additional Information on that Topic: geeksforgeeks.org/data-structures-b-and-b-trees-question-3-2/ […]
… [Trackback]
[…] Find More on that Topic: geeksforgeeks.org/data-structures-b-and-b-trees-question-3-2/ […]
… [Trackback]
[…] Here you will find 61701 more Information to that Topic: geeksforgeeks.org/data-structures-b-and-b-trees-question-3-2/ […]
… [Trackback]
[…] Read More Information here on that Topic: geeksforgeeks.org/data-structures-b-and-b-trees-question-3-2/ […]
… [Trackback]
[…] Find More on on that Topic: geeksforgeeks.org/data-structures-b-and-b-trees-question-3-2/ […]