An array represents a binary heap where node `i` has children `2i+1` and `2i+2`. Implement `isMinHeap(arr)` returning whether every parent is less than or equal to its children.
+ 1 hidden test run on Submit.
Checking the parent-child relationship for every index validates the heap in O(n).
Run your code to see results.