Heaps
•Once you have removed the largest value, you are left with two disjoint heaps:
–Therefore, you need to transform the nodes
–Move the last node and place it in the root
–Then take that value and trickle it down the tree until it reaches a node in which it will not be out of place.