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)