Computer scienceAlgorithms and Data StructuresData structuresLimited access data types

Priority queue

Theory

Time complexity for operations

Report a typo

Match the time complexities for different operations in a priority queue (when implemented using binary heap):

Match the items from left and right columns
Inserting the total of nn elements, one by one
Accessing the highest priority element
Extracting (and removing) an element
O(log⁡n)O(\log{n})
O(n⋅log⁡n)O(n \cdot \log{n})
O(1)O(1)
___

Create a free account to access the full topic