Delete the root, which creates a hole in slot 1 of the array. Percolate the hole DOWN until by comparing the last element in the array with the two children of the location of the hole. Always select the smaller of the two children when percolating down. When the hole comes to a place such that the last array element will fit there, stop. Place it in that slot, and remove it from the last slot of the array.
Insertion uses percolate up, while min deletion uses percolate down.
The max number of percolations in either case is no greater than the max path length in the tree.