Queue based on priority. Each new task/element which has a particular priority is added to the end of the queue and dequeue is at the front. It is implemented via maxheap.. priority being the value.