Question

How we can implement priority queue using max heap data structure. You must use linked list to implement max heap.

Answer 1

#include <iostream>
#include "PriorityQueue.h"

using namespace std;

int main() {
PriorityQueue<string> l;

l.Enqueue(17, "like ");
l.Enqueue(15, "freelance ");
l.Enqueue(19, "I ");
l.Enqueue(16, "to ");
l.Enqueue(10, "day ");
l.Enqueue(13, "every ");

while ( !l.empty() ) {
cout << l.Dequeue();
}

return 0;
}