Objectives : Priority Queue and Heaps

• understand concept of a Priority Queue as an ADT
• understand the concept of a heap as an ADT
• be able to understand alternative implementation approaches with Priority Queues and Heaps
• be able to implement a working interface for a heap
• be able to implement a working interface with an array for a priority queue
• be able to implement a priority queue as a heap