Lecture Synopsis

13. Priority Queues

• Priority Queue ADT
• Implementations
  • Array
  • List
  • Binary Heap
• Heap Operations
  • Insert
  • Delete
  • Heap Construction
    • Top-Down
    • Bottom-Up
• Proof that heap construction is O(n)