Show the following regarding the maximum item in the heap:
a. It must be at one of the leaves.
b. There are exactly _N/2_ leaves.
c. Every leaf must be examined to find it.
We need at least 10 more requests to produce the solution.
0 / 10 have requested this problem solution
The more requests, the faster the answer.