从中序与后序遍历序列构造二叉树

def solve(____):
    inorder = list(map(int, inorder.split(____)))
    postorder = list(map(int, postorder.split(____)))
    def build(____):
        if not inord:
            return []
        root = post[-____]
        idx = inord.index(____)
        left = build(____)
        right = build(____)
        return [root] + left + right
    result = build(____)
    print('____'.join(map(____)))