Data Structures A Min Priority Queue Is A Queue Where The Enqueue Is Based On The Items Value Meaning It Does Not Add To The End Of The Queue. For Example, Starting With An Empty Queue Q: Enqueue(5) -? Q= 5 Enqueue(6) -? Q= 5, 6 Enqueue(3)-? Q= 3, 5, 6 Dequeue()-? Returns 3 And Q=5, 6 Implement The Enqueue Method For A Min Priority Queue Based On

Data structures

A min priority queue is a queue where the enqueue is based on the items value meaning it does not add to the end of the queue. For example, starting with an empty queue Q: enqueue(5) -> Q= 5 enqueue(6) -> Q= 5, 6 enqueue(3)-> Q= 3, 5, 6 dequeue()-> returns 3 and Q=5, 6 Implement the enqueue method for a min priority queue based on a singly linked list. Hint: Sorted insert