Heapsort – Steps 2.1 and 2.2

• extract the greatest element – it is the root node

• take a leaf element of the tree and place it at the top, so that it is the new root