Method percUp

BinaryHeap.py:8–14

(self, i)

    #插入新结点后必要时交换子节点和父节点的位置保持堆的性质
    def percUp(self, i):
        while i//2 > 0:
            if self.heapList[i] < self.heapList[i//2]:
                temp = self.heapList[i//2]
                self.heapList[i//2] = self.heapList[i]
                self.heapList[i] = temp
            i = i//2

    # 插入节点
    def insert(self, k):