1.

Compare different implementations of priority queue

Answer»

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

Operationspeekinsertdelete
Linked ListO(1)O(n)O(1)
Binary HeapO(1)O(log n)O(log n)
Binary Search TreeO(1)O(log n)O(log n)



Discussion

No Comment Found