Question

Compare different implementations of priority queue

Answer 1

The following table contains an asymptotic analysis of different implementations of a priority queue:

Operations	peek	insert	delete
Linked List	O(1)	O(n)	O(1)
Binary Heap	O(1)	O(log n)	O(log n)
Binary Search Tree	O(1)	O(log n)	O(log n)