LeetCode#110 平衡二叉树 Python

这个题对我来说好绕啊，我懂思路但是递归真难理解。。。
看题解看半天还是有点懵，我晕！

# Definition for a binary tree node.
# class TreeNode:
#     def __init__(self, x):
#         self.val = x
#         self.left = None
#         self.right = None

class Solution:
    def isBalanced(self, root: TreeNode) -> bool:
        def recur(root):
            if not root: return 0
            left = recur(root.left)
            if left == -1: return -1
            right = recur(root.right)
            if right == -1: return -1
            return max(left, right) + 1 if abs(left - right) < 2 else -1
        return recur(root) != -1