# Question: from corman algorithms614 answer given in zookal does not explain...

###### Question details

From Corman Algorithms....6.1.4 Answer given in Zookal does not explain how to arrive at "minimum must be among leafs/leaves" or location lower(n/2)+1 using a proof.

Where in a maxheap might the smallest element reside assuming all elements are distinct. Provide a proof.