判断一颗二叉树是否是平衡二叉树

def getdepth(node):

    """
    获取节点为根的深度

    """

    if node == None:
        return 0
    ld = getdepth(node.left) 
    rd = getdepth(node.right)
    
    return max(ld,rd) + 1

"""判断是否平衡"""

def isBalance(head):

    if head == None:
        return True

    ld = getdepth(head.left)
    rd = getdepth(head.right)

    if abs(ld-rd) > 1:
        return False

    return isBalance(head.left) and isBalance(head.right)