Minimum is only at the front of the entire structure, not each heap. Thats because the first element is a heap of size 1. From what I understand, the correct la

Minimum is only at the front of the entire structure, not each heap. Thats because the first element is a heap of size 1. From what I understand, the correct layout would be something like 0 4 2 3 1 Max heap of size 1 containing the smallest element, then a maxheap of size 4 containing the next 4 smallest, etc