Creates a max heap out of an unorganized Interface collection.

Removes and returns the maximum of the heap and reorganizes.

This function will push a new value into a priority queue.

Removes and returns the element at index i.

Any type that implements Interface may be used as a max-tree.