as we did with insertlet us have look at how the whole operation is meant to work on an existing heap imagine the following heap we pop off the root elementleaving the heap temporarily rootlesssince we cannot have rootless heapwe need to fill this slot with something if we choose to move up one of the childrenwe will have to figure out how to rebalance the entire tree structure so insteadwe do something really interesting we move up the very last element in the list to fill the position of the root elementnow this element clearly is not the lowest in the heap this is where we begin to sink it down first we need to determine where to sink it down we compare the two childrenso that the lowest element will be the one to float up as the root sinks down