class BinaryHeap: def __init__(self): self.heap=[] self.dataLoopUp={} def parent(self,i): return int((i-1)/2) def left(self,i): return i*2+1 def right(self,i): return i*2+2 def empty(self): if len(self.heap)==0: return True else: return False def processUp(self,i=-1): if i==(-1): i=len(self.heap)-1 while i>0 and self.heap[self.parent(i)][0]>self.heap[i][0]: self.heap[self.parent(i)],self.heap[i]=self.heap[i],self.heap[self.parent(i)] self.dataLoopUp[self.heap[self.parent(i)][1]]=self.parent(i) self.dataLoopUp[self.heap[i][1]]=i i=self.parent(i) def processDown(self,i=-1): if i==(-1): i=0 while (self.left(i)self.heap[self.dataLoopUp[data]][0]: return my_list=list(self.heap[self.dataLoopUp[data]]) my_list[0]=f self.heap[self.dataLoopUp[data]]=tuple(my_list) self.processUp(self.dataLoopUp[data])