describe the concept of priority queue in detail
A priority queue can efficiently implemented using which of the following data structures? Assume that the number of insert and peek (operation to see the current highest priority item) and extraction (remove the highest priority item) operations are almost same. Option are
Array
Linked list
Heap Data
Structure
None of these