Chapter 4
Advanced General Purpose Data Structures
Section 1
Priority Queue ADT and Heap
A priority queue ADT is similar to a queue but the elements have a feature called priority. A heap is a balanced binary tree with some constraints. We will get to know more about them in this video. - Create interface for priority queue - Insert and remove elements from heap - Analyze complexity and implement serialized and array- backed heap