Multiple choice Find the odd one out. Ascending priority queue - Min Heap Descending priority queue - Max Heap Binary Search Tree - Sorting 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.