What is the time complexity of binary heap?

Best case O(1) peek. Average case O(log n). Worst case O(log n). Space complexity is O(n). Sift up and sift down each travel one root-to-leaf path.

Binary heap

medium

No pointers anywhere - node i's children are at 2i+1 and 2i+2. Push, pop, and build a heap from an arbitrary array in O(n) rather than O(n log n).

Best O(1) peekAverage O(log n)Worst O(log n)Space O(n)

Loading the binary heap engine…

Build a heap in the array, then extract the maximum n times.

Settle the closest unvisited node, then relax its edges.

Merge the two rarest symbols, repeatedly.