Skip to main content

Heap Vis

Min-Heap • Max-Heap • Priority

Add elements to the heap

Run an operation to see step-by-step explanation.

1x
Ready
Algorithm Details

Run an operation to see step-by-step explanation.

Complexity

Time

O(log n)

Space

O(1)

Heapify Up (Min-Heap)
1function heapifyUp(heap, i) {
2 while (i > 0) {
3 const parent = (i - 1) >> 1;
4 if (heap[i] >= heap[parent]) break;
5 swap(heap, i, parent);
6 i = parent;
7 }
8}