Background
Priority queues are versatile and complex data structures that can be implemented multiple ways. In this lab, you will do that very thing.
List-Based Heap Implementations
The book starts out by discussing the concept of a priority queue and how to implement it conceptually. Then, the first implementation is presented: using an array or Python sequence to represent the heap.
Our customer support team is here to answer your questions. Ask us anything!
👋 How can we help with you?