          if right_child_index >= len(self.array):
              # No left child
              if left_child_index >= len(self.array):
                  return -1
              else:
                  return left_child_index
          else:
              # Compare left and right children
              if self.array[left_child_index] < self.array[right_child_index]:
 
</s> remove                 return right_child_index </s> add  </s> remove         index_parent = (index-1) // 2
 </s> add         index_parent = (index - 1) // 2
            # Left child only
          if right_child_index >= len(self.array):
              # No left child
              if left_child_index >= len(self.array):
                  return -1
            # Left child only
              else:
                  return left_child_index
          else:
              # Compare left and right children
              if self.array[left_child_index] < self.array[right_child_index]:
keep keep keep add keep keep keep keep keep
 #273: Remove nose dependency for graphs_trees/ (#277) 
graphs_trees/min_heap/min_heap.py