Implementation Priority Queue Efficient Dequeue Operation O Heap Binary Search Tree O Link Q37247401

Which implementation of a priority queue has the most efficient dequeue operation. o heap binary search tree O Linked List Show transcribed image text Which implementation of a priority queue has the most efficient dequeue operation. o heap binary search tree O Linked List

Answer

Linked List. because it takes only O(1) for Linked listfor dequeue.