二叉树高度

def solve():
    class TreeNode:
        def __init__(____):
            self.val = val
            self.left = None
            self.right = None
    root = TreeNode(____)
    root.left = TreeNode(____)
    root.right = TreeNode(____)
    root.left.left = TreeNode(____)
    root.left.right = TreeNode(____)
    def height(____):
        if node is None:
            return ____
        return ____ + max(height(____), height(____))
    print(height(____))