The heap that this chapter described is called a maxheap because the largest element is at the root. This organization is appropriate because the pqDelete operation for the heap implementation of the priority queue deletes the element with the highest priority value. Suppose that you wanted the pqDelete operation to delete the element with the lowest priority value instead. You would then use a minheap. Convert the maxheap implementation to a minheap implementation.
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.