a container that stores elements which have keys which can be compared
a data structure for maintaining a set of elements, each with an associated value called a key
a data structure that is ordered so that it provides fast access to its minimum element, as defined by some ordering relationship
a data structure that maintains a set of elements and supports operations insert, decrease key, and extract min
a line, but one where each element has a priority
a partially-ordered container that allows for removal of the element with lowest (or highest, depending on the comparator used) priority
a queue, where each element of the queue stores a tuple containing a value x and a priority p ( x ) that is an integer
a queue where the order in which elements are popped off the queue is determined by a binary predicate function
a variation on the queue which does not qualify for the name FIFO, because it is not accurately descriptive of that data structure 's behavior
A queue that has a priority assigned to its elements. When accessing elements, the element with the highest priority is removed first. A priority queue has a largest-in, first-out behavior. See queue.