algorithm/leetcode-master
1
0
Fork 0
mirror of https://github.com/youngyangyang04/leetcode-master.git synced 2025-07-11 21:10:58 +08:00
Code Issues Packages Projects Releases Wiki Activity

Update 0110.平衡二叉树.md

Browse Source
This commit is contained in:
jianghongcheng
2023-05-24 01:56:01 -05:00
committed by GitHub
parent 450b3f2f15
commit 832897e4bb
1 changed files with 10 additions and 12 deletions
Download Patch File Download Diff File Expand all files Collapse all files

22
problems/0110.平衡二叉树.md
View File

@ -536,18 +536,16 @@ class Solution:
```python ```python
class Solution: class Solution:
def isBalanced(self, root: TreeNode) -> bool: def isBalanced(self, root: Optional[TreeNode]) -> bool:
return self.height(root) != -1 return self.get_hight(root) != -1
def height(self, node: TreeNode) -> int: def get_hight(self, node):
if not node: if not node:
return 0 return 0
left = self.height(node.left) left = self.get_hight(node.left)
if left == -1: right = self.get_hight(node.right)
return -1 if left == -1 or right == -1 or abs(left - right) > 1:
right = self.height(node.right) return -1
if right == -1 or abs(left - right) > 1: return max(left, right) + 1
return -1
return max(left, right) + 1
``` ```