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