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