Skip to main content

🎮 Heaps (Practice)

Companion to the Heaps & Priority Queues guide. Watch a min-heap build by sifting each new value up, then use heapq for top-K.

🎬 Watch it work​

Min-Heap Insert — sift upStep 1 / 21
7
Insert 7 at index 0

🐍 Your turn​

Loading editor…

🧠 Challenge yourself​

  1. Build a max-heap using the negate trick.
  2. Implement a streaming median with two heaps.
  3. Why is heapify O(n) but k pushes O(n log n)?

Continue the path → Trees & BST