← ~/visualizations

building-a-max-heap

Blocky complete binary tree visualization of max-heap construction. Starts from an unordered array and applies bottom-up heapify with animated sift-down operations.

canvasclick to interact
t=0s

practical uses

  • 01.Teaching priority queue implementation
  • 02.Visualizing heap sort mechanics
  • 03.Demonstrating heap property maintenance
  • 04.Explaining efficient min/max extraction

technical notes

9-element array displayed as complete binary tree. Animates bottom-up heapify: compares parent with children, swaps when child is larger, sifts down until heap property holds.