← OYO questions

Implement a heap data structure and heapify

Filed under OYO

Implement a binary Min-Heap data structure from scratch. The implementation should support push (inserting an element), pop (extracting the minimum element), peek (viewing the minimum), and heapify…

You've read your 3 free write-ups

Sign up free to keep reading. Your account opens the first 10 questions of every company.

Related OYO questions

Collected from public candidate posts and coding forums. Updated Nov 2026.