平衡二叉树判断

def solve():
    class TreeNode:
        def __init__(____):
            self.val = val
            self.left = None
            self.right = None
    def check(____):
        if node is None:
            return ____
        lh = check(____)
        rh = check(____)
        if lh == -____ or rh == -____ or abs(____) > ____:
            return -____
        return ____ + max(____)
    root = TreeNode(____)
    root.left = TreeNode(____)
    root.right = TreeNode(____)
    root.left.left = TreeNode(____)
    print(check(____) != -____)