← OYO questions

Write code for max-heapify

Filed under OYO

Given an array representation of a binary tree and an index `i`, implement `max_heapify(arr, n, i)` where `n` is the heap size. Assume the binary subtrees rooted at left and right children of `i`…

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.