leetcode-study-system/110.balanced-binary-tree.py at main · taoluo/leetcode-study-system · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
#
# @lc app=leetcode id=110 lang=python3
#
# [110] Balanced Binary Tree
#

# Difficulty: Easy
# Frequency: 58.4%
# Tags: Tree, Depth-First Search, Binary Tree
# URL: https://leetcode.com/problems/balanced-binary-tree/
#
# --- Problem Description ---
#
# Given a binary tree, determine if it is height-balanced.
#
#
#
# Example 1:
#
# Input: root = [3,9,20,null,null,15,7]
# Output: true
#
# Example 2:
#
# Input: root = [1,2,2,3,3,null,null,4,4]
# Output: false
#
# Example 3:
#
# Input: root = []
# Output: true
#
#
#
# Constraints:
#
# 	  - The number of nodes in the tree is in the range [0, 5000].
# 	  - -10^(4) <= Node.val <= 10^(4)
#

#
# --- Community Solutions ---
#
# https://leetcode.com/problems/balanced-binary-tree/solutions
#

# @lc code=start
# 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:


# @lc code=end