Double-ended priority queues
2 methods in the atlas attack this one problem. They are rivals: each wins something the others do not.
Phrasings that mean this problem
Min-max queries
search-structures
- Double-ended priority queueInterval-heap invariantspecialistsearch-structures
- Min-max heapAlternating min and max levelsspecialistsearch-structures