mirror of
https://github.com/krahets/LeetCode-Book.git
synced 2026-01-12 00:19:02 +08:00
649c652c59
1. Update topic names of Pyhon file. 2. Replace the binary tree printer with a more clear one. 3. Update README.
26 lines
725 B
Python
26 lines
725 B
Python
'''
|
|
File: sfo_55-ii_balanced_binary_tree_s2.py
|
|
Created Time: 2021-12-09
|
|
Author: Krahets (krahets@163.com)
|
|
'''
|
|
|
|
from include import *
|
|
|
|
# ===== Solution Code =====
|
|
class Solution:
|
|
def isBalanced(self, root: TreeNode) -> bool:
|
|
if not root: return True
|
|
return abs(self.depth(root.left) - self.depth(root.right)) <= 1 and \
|
|
self.isBalanced(root.left) and self.isBalanced(root.right)
|
|
|
|
def depth(self, root):
|
|
if not root: return 0
|
|
return max(self.depth(root.left), self.depth(root.right)) + 1
|
|
|
|
# ======= Test Case =======
|
|
root = list_to_tree([3, 9, 20, None, None, 15, 7, None, None, None, None])
|
|
# ====== Driver Code ======
|
|
slt = Solution()
|
|
res = slt.isBalanced(root)
|
|
print(res)
|