priority queue


priority queue

(programming)A data structure with three operations: insert anew item, return the highest priority item, and remove thehighest priority item. The obvious way to represent priorityqueues is by maintaining a sorted list but this can make theinsert operation very slow. Greater efficiency can beachieved by using heaps.