平衡二叉树

def solve(____):
    def height(____):
        if not node:
            return ____
        left = height(____)
        right = height(____)
        if left == -____ or right == -____ or abs(____) > ____:
            return -____
        return ____ + max(____)
    return height(____) != -____