What is the underlined datastructure of priority queue
Underline principal for priority queue
they are based upon the concept of min heap or max heap, although
Priority Queues can be implemented using common data structures like arrays, linked-lists, heaps and binary trees. The list is so created so that the highest priority element is always at the head of the list. The list is arranged in descending order of elements based on their priority.