heaps childindex parentindex childindex parentindex since the second of these indices is beyond the last index of the listthe __siftdownfromto method will not consider childindex after considering the and the we see that those two nodes do in fact form heap as shown in fig we will show this in the following figures by joining them with an arrow we now have heapsone less than we started with more importantlywe only had to sift the parent down one position at the most nextwe move back one more in the list to index we call __siftdownfromto specifying to start from this node doing so causes the sift down method to pick the larger of the two children to swap withforming heap out of the three values - and as result this is depicted in fig fig after forming sub-heap fig after forming second sub-heap this copy belongs to 'acha