从二叉树到堆树的转换-陷入无限循环

class TreeNode:
    def __init__(self, value):
        self.value = value
        self.left = None
        self.right = None

def heapify(root):
    if not root:
        return
    
    # 找到最后一个非叶子节点
    last_node = root
    while last_node.left:
        last_node = last_node.left
    
    # 从最后一个非叶子节点开始堆化
    while last_node:
        parent = last_node
        child = parent.left if parent.left else parent.right
        
        if child and child.value > parent.value:
            parent.value, child.value = child.value, parent.value
        
        if parent == root:
            break
        
        last_node = parent.parent

# 示例用法
root = TreeNode(10)
root.left = TreeNode(5)
root.right = TreeNode(7)
root.left.left = TreeNode(3)
root.left.right = TreeNode(8)

heapify(root)