      def insert(self, key):
          if key is None:
              raise TypeError('key cannot be None')
          self.array.append(key)
          self._bubble_up(index=len(self.array)-1)
  
      def _bubble_up(self, index):
          if index == 0:
              return
          index_parent = (index-1) // 2
 
</s> remove         index_parent = (index-1) // 2
 </s> add         index_parent = (index - 1) // 2 </s> remove         self.add_edge(dst_key, src_key, weight) </s> add  </s> remove                 result.append(curr_word+key)
            self._list_words(child, curr_word+key, result) </s> add 
        self._bubble_up(index=len(self.array) - 1)
      def insert(self, key):
          if key is None:
              raise TypeError('key cannot be None')
          self.array.append(key)
        self._bubble_up(index=len(self.array) - 1)
  
      def _bubble_up(self, index):
          if index == 0:
              return
          index_parent = (index-1) // 2
keep keep keep keep replace keep keep keep keep keep
 #273: Remove nose dependency for graphs_trees/ (#277) 
graphs_trees/min_heap/min_heap.py