ABSTRACT
A priority queue is an untagged algorithmically positioned collection of comparable elements in which there can be equivalent elements. The primary methods are to add an element, find a maximum priority element, and remove a maximum priority element. In addition, one can remove an element or change the priority of an element through a locator. However, there is no efficient general search method.
