Time: 48 ms (47.76%) | Memory: 17.5 MB (91.62%) - LeetSync

Author: audemed44

110-balanced-binary-tree/balanced-binary-tree.py

@@ -0,0 +1,18 @@
+# Definition for a binary tree node.
+# class TreeNode:
+#     def __init__(self, val=0, left=None, right=None):
+#         self.val = val
+#         self.left = left
+#         self.right = right
+class Solution:
+    def isBalanced(self, root: Optional[TreeNode]) -> bool:
+        def dfs(root):
+            if not root:
+                return [True, 0]
+            
+            left, right = dfs(root.left), dfs(root.right)
+            is_balanced = (left[0] and right[0] and
+                          abs(left[1]-right[1])<=1)
+            return [is_balanced, 1+max(left[1],right[1])]
+        return dfs(root)[0] 
+