목록을 최대 힙으로 힙화

list = [20, 5, 30, 10, 15, 45]

def getChildren(pIndex, list):
    leftIndex = pIndex * 2 + 1
    rightIndex = pIndex * 2 + 2

    left = -1
    if leftIndex < len(list):
        left = list[leftIndex]

    right = -1
    if rightIndex < len(list):
        right = list[rightIndex]

    return left, right

def heapify(list):

    for i in range(len(list)-1, -1, -1):
        p = list[i]
        left, right = getChildren(i, list)

        bigChild = max(left, right)

        bigChildIndex = 2 * i + 1
        if right == max(left, right):
            bigChildIndex = 2 * i + 2

        j = i
        while p < bigChild and bigChildIndex < len(list) and j < len(list):
            list[j] = bigChild
            list[bigChildIndex] = p

            j = bigChildIndex
            left, right = getChildren(j, list)
            bigChild = max(left, right)
            bigChildIndex = 2 * j + 1

    return list

print(heapify(list))