Multiple choice

Find the odd one out.

  1. Ascending priority queue - Min Heap

  2. Descending priority queue - Max Heap

  3. Binary Search Tree - Sorting

  4. B-Tree - Index Sequential Search

Reveal answer Fill a bubble to check yourself
C Correct answer
Explanation

The other options pair a data structure with its primary application or property (Priority Queues with Heaps, B-Trees with indexing). A Binary Search Tree is a data structure, not a sorting algorithm itself, though it can be used for sorting.