Practice
Learn
← Quit
0 / 0 correct
Data Structures
Hard
1 of 40
How does a double-ended priority queue (min and max) typically get implemented?
A
A min-max heap or two heaps with cross-references, or a balanced BST
B
A hash map
C
A single stack
D
An unsorted array with O(1) min and max