Efficient Priority Queues

• Straightforward Implementations of Priority Queues
• Array Implementation of Priority Queues
• Array Implementation: Adding an Item
• Array Implementation: Removing an Item
• Linked List Implementation of Priority Queues
• Linked List Implementation: Removing an Item
• Linked List Implementation: Adding an Item
• Array and Linked List Implementation Summary
• The java.util.PriorityQueue Class
• Binary Heaps
• The Heap Property
• Binary Search Trees for Priority Queues?
• Binary Heaps as Priority Queues
• Removing from a Binary Heap
• Adding to a Binary Heap
• The Efficiency of Binary Heap Adds and Removes
• The Height of Balanced Binary Trees
• The Advantage of Logarithmic Time Operations
• Implementations of Binary Heaps
• An Array Implementation of Binary Heaps
• Child and Parent Operations
• Further Optimizations