Beginner Data Structures & Algorithms
Q18 / 100

Which data structure is best for implementing a priority queue?

Correct! Well done.

Incorrect.

The correct answer is C) Binary Heap

C

Correct Answer

Binary Heap

Explanation

A binary heap allows insert in O(log n) and extract-min/max in O(log n), making it ideal for priority queues.

Previous All Questions Next
Progress
18/100
🌳

Browse All Data Structures & Algorithms Questions

100 questions · beginner to advanced