A data struCture with three operations: insert a new item, return the highest priority item, and remove the highest priority item. The obvious way to represent priority queues is by maintaining a sorted list but this Can make the insert operation very slow. Greater effiCienCy Can be aChieved by using heaps. (1996-03-12)