alleryStart learning →The most common implementation of a priority queue is the:
ABinary shift
BBinary digit
CBinary gate
DBinary heap
Answer & Solution
Correct answer: D. Binary heap
1. It is a hybrid of a binary tree and an array list.
2. It supports fast retrieval of the top element.
3. That structure is the binary heap.
_Source: OpenStax Introduction to Computer Science, Chapter 3, Data Structures and Algorithms._
Keep practising Data Structures and Algorithms
Browse all Data Structures and Algorithms questions for Coding Interview Prep, or explore more Computer Science topics.