Leetcode 剑指 Offer 55 - II. 平衡二叉树

剑指 Offer 55 - II. 平衡二叉树

Ideas

算法：递归
数据结构：二叉树

Code

# 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:
        
        if not root:
            return True

        self.flag = True

        def depth(node):
            if not node:
                return 0
            L = depth(node.left)
            R = depth(node.right)
            if(abs(L - R)) > 1:
                self.flag = False
            return max(L, R) + 1

        depth(root)        
        return self.flag