如何使用heapsort打印奇数的顺序，然后打印偶数而不是更小的数字？

def heapify(arr, n, i):
    largest = i
    l = 2 * i + 1
    r = 2 * i + 2

    if l < n and arr[i] < arr[l]:
        largest = l

    if r < n and arr[largest] < arr[r]:
        largest = r

    if largest != i:
        arr[i], arr[largest] = arr[largest], arr[i]
        heapify(arr, n, largest)

def heapsort(arr):
    n = len(arr)

    # 构建最大堆
    for i in range(n // 2 - 1, -1, -1):
        heapify(arr, n, i)

    # 将奇数和偶数分别放入堆中
    odd_heap = []
    even_heap = []
    for num in arr:
        if num % 2 == 0:
            even_heap.append(num)
        else:
            odd_heap.append(num)

    # 对奇数堆进行排序并输出
    for i in range(len(odd_heap) - 1, -1, -1):
        heapify(odd_heap, len(odd_heap), i)
        print(odd_heap[i])

    # 对偶数堆进行排序并输出
    for i in range(len(even_heap) - 1, -1, -1):
        heapify(even_heap, len(even_heap), i)
        print(even_heap[i])

# 测试示例
arr = [4, 7, 2, 9, 1, 5, 8, 3, 6]
heapsort(arr)