table child and parent indices childindex parentindex (childindex )// (swap (swap (stopfig heap after moving to correct location sifting up the in the heap' list results in two swaps before it reaches its final location figure shows the is swapped with the at index then it is swapped again with the at index at this point no more swaps are done because is greater than the has reached its proper position within the heap analysis of version phase the approach taken in version of phase is slow as we shall see consider perfect complete binary tree one which is completely full on all levels with levels as shown in fig consider the relationship between the number of levels and the number of items in the heap as shown in table fig perfect binary tree this copy belongs to 'acha