A Binary Max Heap is a complete binary tree (all levels except the last are fully filled, and the last level is filled from left to right) that maintains the heap property (each node is greater than each of its children).

All available operations on the Heap will be shown here. Select an action and provide the necessary input, and the action will be animated in the visualisation area.

View the visualisation here!

As the action is being carried out, each step will be described in the status panel.

You can also follow the psuedocode highlights to trace the algorithm.

Control the animation with the player controls! Keyboard shortcuts are:
Left/right arrows: step backward/step forward
-/+: decrease/increase speed

Return to "Exploration Mode" to start exploring!