A priority queue is an abstract data type (ADT) which defines a container for a set of elements, each of which has an associated priority. The ADT specifies a method to access the highest priority element, which can be either a minimum or a maximum.
