Let H[1...n] be a heap with n elements. The item to be deleted occupies position 1 in the heap. It will be replaced with the node that occupies position n. The new element at position 1 will be "demoted" until the heap property will be restored.