Feature/min priority queue

[Afreen-Kazi-1]

Overview

This code implements a Minimum Priority Queue, where enqueued elements are simply sorted as per minimum priority and while dequeuing the element with minimum priority is dequeued first. This data structure provides access to the smallest element in constant time. This task tries to implement this data structure using another data structure called Linked List which gives more clarity on how we can relate the two different data structures.

Issues Addressed

99

Guidelines followed

• Code is completed with comments where necessary
• Can be tested as it allows user input and output

[yesiamrajeev]

nice!!

[Afreen-Kazi-1]

After you've merged, I can close the issue right?

[yesiamrajeev]

Yeah, that's how it works!!! HAPPY-HACKING!!