Symmetric Min-Max heap: A simpler data structure for double-ended priority queue

A data structure for implementing double-ended priority queues that is easy to understand and implement is presented. The data structure uses only one array, and there is no explicit separation of the min-heap and max-heap.