Priority Queue using Linked Lists(c++)

Linked lists are one of the many "linked" data structures that are used to store information. In this assignments, you will write a simple linked list class, and then use it to keep track of allocations and deallocations in a "heap" of memory. This homework has 2 problems.

Related HackerRank Problems

C++ -> Introduction -> Pointers

Data Structures -> Linked Lists -> Insert a node at a specific position

Data Structures -> Linked Lists -> Delete a node

Problem 5a : Priority Queue

A priority queue is a data structure in which objects can be inserted or removed. When an object is placed in the priority queue, it is added with a given priority value. When an object is removed, the object in the queue with the highest priority is removed. One simple way to implement a priority queue is to use a linked list.

Implement a priority queue for Strings using a linked list. Each string will have a priority associated with it. Note that you are required to implement a linked list to implement the priority queue. Submissions that do not use a linked list will get a score of 0.

Input will consist of a series of queries, which are one of the following:

add a string to the priority queue with a given priority

remove a string from the priority queue and print its value

The word "quit" will signal the end of the input.

Sample program run

 PROGRAM INPUT: -------------- insert hello 3 insert goodbye 2 remove insert apple 4 remove remove quit PROGRAM OUTPUT: --------------- hello apple goodbye