如何检查给定的preorder、inorder和postorder遍历是否属于相同的二叉树？

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

def check_tree(preorder, inorder, postorder):
    if len(preorder) != len(inorder) or len(preorder) != len(postorder):
        return False

    if len(preorder) == 0:
        return True

    root_val = preorder[0]
    root_index = inorder.index(root_val)

    left_inorder = inorder[:root_index]
    right_inorder = inorder[root_index+1:]

    left_preorder = preorder[1:1+len(left_inorder)]
    right_preorder = preorder[1+len(left_inorder):]

    left_postorder = postorder[:len(left_inorder)]
    right_postorder = postorder[len(left_inorder):-1]

    left_tree = check_tree(left_preorder, left_inorder, left_postorder)
    right_tree = check_tree(right_preorder, right_inorder, right_postorder)

    return left_tree and right_tree

# 示例用法
preorder = [1, 2, 4, 5, 3, 6, 7]
inorder = [4, 2, 5, 1, 6, 3, 7]
postorder = [4, 5, 2, 6, 7, 3, 1]

result = check_tree(preorder, inorder, postorder)
print(result)  # 输出：True