          # No right child
          if right_child_index >= len(self.array):
              if left_child_index >= len(self.array):
                  return -1
              # Left child only
              else:
                  return left_child_index
 
</s> remove                 return right_child_index </s> add  </s> remove                 result.append(curr_word+key)
            self._list_words(child, curr_word+key, result) </s> add 
            # No left child
          # 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:
                  return left_child_index
keep add keep keep keep keep keep
 #273: Remove nose dependency for graphs_trees/ (#277) 
graphs_trees/min_heap/min_heap.py