由二叉树的前序遍历和‘#’构建二叉树 Python3版本

class TreeNode():
    def __init__(self,val):
        self.val = val
        self.left = None
        self.right = None
def f(l):
    val = l.pop(0)
    if val == '#':
        return None
    else:
        node = TreeNode(val)
        node.left = f(l)
        node.right = f(l)
    return node