From 832897e4bbeb21c5906729257af347f6cd90c97c Mon Sep 17 00:00:00 2001
From: jianghongcheng <35664721+jianghongcheng@users.noreply.github.com>
Date: Wed, 24 May 2023 01:56:01 -0500
Subject: [PATCH] =?UTF-8?q?Update=200110.=E5=B9=B3=E8=A1=A1=E4=BA=8C?=
 =?UTF-8?q?=E5=8F=89=E6=A0=91.md?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 problems/0110.平衡二叉树.md | 22 ++++++++++------------
 1 file changed, 10 insertions(+), 12 deletions(-)

diff --git a/problems/0110.平衡二叉树.md b/problems/0110.平衡二叉树.md
index c0561e10..e10a612a 100644
--- a/problems/0110.平衡二叉树.md
+++ b/problems/0110.平衡二叉树.md
@@ -536,18 +536,16 @@ class Solution:
 
 ```python
 class Solution:
-    def isBalanced(self, root: TreeNode) -> bool:
-        return self.height(root) != -1
-    def height(self, node: TreeNode) -> int:
-            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:
-                return -1
-            return max(left, right) + 1
+    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.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
 ```