mirror of
https://github.com/youngyangyang04/leetcode-master.git
synced 2025-07-11 21:10:58 +08:00
Update 0110.平衡二叉树.md
This commit is contained in:
@ -536,16 +536,14 @@ class Solution:
|
||||
|
||||
```python
|
||||
class Solution:
|
||||
def isBalanced(self, root: TreeNode) -> bool:
|
||||
return self.height(root) != -1
|
||||
def height(self, node: TreeNode) -> int:
|
||||
def isBalanced(self, root: Optional[TreeNode]) -> bool:
|
||||
return self.get_hight(root) != -1
|
||||
def get_hight(self, node):
|
||||
if not node:
|
||||
return 0
|
||||
left = self.height(node.left)
|
||||
if left == -1:
|
||||
return -1
|
||||
right = self.height(node.right)
|
||||
if right == -1 or abs(left - right) > 1:
|
||||
left = self.get_hight(node.left)
|
||||
right = self.get_hight(node.right)
|
||||
if left == -1 or right == -1 or abs(left - right) > 1:
|
||||
return -1
|
||||
return max(left, right) + 1
|
||||
```
|
||||
|
Reference in New Issue
Block a user