Priority Queues as Linked Lists
An ordered linked list can be used to represent a priority queue. This requires examining an average of n / 2 nodes for insertion and one node for deletion.
An unordered representation requires the examination of one node for insertion and n nodes for deletion.
Advantage of linked implementation over array implementation is that no movement of elements is required when an item is deleted.