Priority Queues with Heap Data structure #93
Description
The Priority Queue in this library is implemented by linked lists, but it has a lot of disadvantages. It is instead preferred for the Priority Queue to be implemented in the Heap data structure.
So we could re-implement Priority Queues in the Heap data structure.