Turning Learners Into Developers
Codekilla
CODEKILLA
back to course
Lesson 117 / 14979%
Heaps & Priority Queues6/7

Heap Operation — Heapify

Turn an arbitrary array into a heap in O(n).

// min-heap · insert(2) · bubble up · final root = min59121520array:59121520Initial min-heap. Click steps to insert 2 and watch it bubble up to the root.
Visual explanation diagram · click steps to walk through it

This lesson is Pro only.

Unlock every premium lesson and module — Pro from ₹299 / month (or ₹999 / year, saves ~₹2,589).

Sign in to unlock
// feedback.matters()
Did this lesson help you?