diff --git a/problems/0110.平衡二叉树.md b/problems/0110.平衡二叉树.md
index 804c95eb..a3bc77fb 100644
--- a/problems/0110.平衡二叉树.md
+++ b/problems/0110.平衡二叉树.md
@@ -532,6 +532,24 @@ class Solution:
         else:
             return 1 + max(left_height, right_height)
 ```
+递归法精简版：
+
+```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
+```
+
 
 迭代法：