We will start with the heap that contains the letters F, E, D, C, B, and A, which were entered in that order.
Initial heap with 6 nodes. Remove the letter A. Move the last node to the root. Sift down. Exchange E and B. Remove the letter B. Move the last node to the root. Sift down. Exchange D and C. Remove the letter C. Move the last node to the root. Sift down. Exchange F and D. Remove the letter D. Move the last node to the root.