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.
Example 1:
Given the following tree [3,9,20,null,null,15,7]
:
3
/ \
9 20
/ \
15 7
Return true.
Example 2:
Given the following tree [1,2,2,3,3,null,null,4,4]
:
1
/ \
2 2
/ \
3 3
/ \
4 4
Return false.
class Solution:
def __init__(self):
self.balance = True
def height(self,node):
if not node:
return 0
leftHeight = self.height(node.left)
rightHeight = self.height(node.right)
if abs(leftHeight - rightHeight) > 1:
self.balance = False
return 1 + max(leftHeight,rightHeight)
def isBalace(self,root):
if not root:
return True
self.height(root)
return self.balance