Which one of the following is a key factor for preferring B-trees to binary search trees for indexing database relations?

**(A)** Database relations have a large number of records

**(B)** Database relations are sorted on the primary key

**(C)** B-trees require less memory than binary search trees

**(D)** Data transfer form disks is in blocks.

**Answer:** **(D)** **Explanation:** A disk block contains fairly large number of keys. Unlike BST where each node contains only one key, B-Tree is designed to contain large number of keys so that tree height is small.

Quiz of this Question

## Recommended Posts:

- Data Structures | B and B+ Trees | Question 1
- Data Structures | B and B+ Trees | Question 4
- Data Structures | B and B+ Trees | Question 3
- Data Structures | Binary Trees | Question 1
- Data Structures | Binary Trees | Question 6
- Data Structures | Binary Trees | Question 15
- Data Structures | Binary Trees | Question 4
- Data Structures | Binary Trees | Question 3
- Data Structures | Binary Trees | Question 10
- Data Structures | Binary Trees | Question 15
- Data Structures | Binary Trees | Question 12
- Data Structures | Binary Trees | Question 9
- Data Structures | Binary Trees | Question 8
- Data Structures | Binary Trees | Question 13
- Data Structures | Binary Trees | Question 14
- Data Structures | Binary Trees | Question 11
- Data Structures | Binary Trees | Question 15
- Data Structures | Binary Search Trees | Question 1
- Data Structures | Binary Search Trees | Question 2
- Data Structures | Binary Search Trees | Question 7