using python

Implement Priority Queue using Linked Lists. enqueue(): This function is used to insert a new data into the queue. dequeue(): This function removes the element with the highest priority form the queue. If 2 elements have same priority then the concept of FIFO will be applied peek()/top(): This function is used to get the highest priority element in the queue without removing it from the queue