  
      def _bubble_up(self, index):
          if index == 0:
              return
          index_parent = (index-1) // 2
          if self.array[index] < self.array[index_parent]:
              # Swap the indices and recurse
              self.array[index], self.array[index_parent] = \
                  self.array[index_parent], self.array[index]
              self._bubble_up(index_parent)
 
</s> remove         self._bubble_up(index=len(self.array)-1)
 </s> add         self._bubble_up(index=len(self.array) - 1)
        index_parent = (index - 1) // 2
  
      def _bubble_up(self, index):
          if index == 0:
              return
        index_parent = (index - 1) // 2
          if self.array[index] < self.array[index_parent]:
              # Swap the indices and recurse
              self.array[index], self.array[index_parent] = \
                  self.array[index_parent], self.array[index]
              self._bubble_up(index_parent)
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