Such an operation creates at every step i the heap with the root H[i], combining two heaps of similar size, the heap with the root 2*i with the root heap 2*i+1 and with the element H[i]. The parent node (initially i) is "demoted" being replaced by the son with the highest value until the heap property will be restored.