Heap Visualization

About Heaps

A heap is a complete binary tree where each node satisfies the heap property. In a min heap, parent nodes are smaller than children. In a max heap, parent nodes are larger than children.

Insert: O(log n)
Extract Root: O(log n)
Peek Root: O(1)
Heapify: O(n)

Array Representation

Ready - Min Heap Mode