Heaps
•To remove an item from
a heap, we remove the largest item (or the item
with the highest priority).
•Because the value of
every node is greater than or equal to that
of either of its children, the largest value
must be the root of the tree.
•A remove operation is
simply to remove the item at the root and
return it to the calling routine.