Balanced Binary Tree

Given a binary tree, determine if it is height-balanced.

For this problem, a height-balanced binary tree is defined as a binary tree in which the depth of the two subtrees of every node never differ by more than 1.

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

class Solution(object):
    def isBalanced(self, root):
        """
        :type root: TreeNode
        :rtype: bool
        """
        if not root:
            return True
        return abs(self.hight(root.left) - self.hight(root.right)) < 2 and self.isBalanced(root.right) and self.isBalanced(root.left)

    def hight(self, root):
        if not root:
            return 0
        return 1 + max(self.hight(root.left), self.hight(root.right))