Multiple choice

Which of the following data structures is the most efficient for storing data for efficient retrieval in a block-oriented storage context?

  1. Simple linked list

  2. BST

  3. B+ tree

  4. Hash table

  5. AVL tree
Reveal answer Fill a bubble to check yourself
C Correct answer
Explanation

The primary value of a B+ tree is in storing data for efficient retrieval in a block-oriented storage context — in particular, filesystems. This is primarily because unlike binary search trees, B+ trees have very high fanout (number of pointers to child nodes in a node,typically on the order of 100 or more), which reduces the number of I/O operations required to find an element in the tree.

Keep practicing — related questions