What type of tree is best used for indexing external data?
A)B-tree
B)binary search tree
C)2-3-4 tree
D)AVL tree

Question

Quizplus · Accepted Answer

B-trees are specifically designed for indexing external data, such as on hard drives or in databases. They have a balanced structure and are optimized for efficient disk access, making them the best choice for indexing large amounts of external data. Binary search trees and AVL trees are better suited for in-memory data, while 2-3-4 trees are less commonly used for indexing external data.

What Type of Tree Is Best Used for Indexing External