diff --git a/problems/1382.将二叉搜索树变平衡.md b/problems/1382.将二叉搜索树变平衡.md
index b9d4fb65..75530663 100644
--- a/problems/1382.将二叉搜索树变平衡.md
+++ b/problems/1382.将二叉搜索树变平衡.md
@@ -55,7 +55,7 @@ private:
         vec.push_back(cur->val);
         traversal(cur->right);
     }
-    有序数组转平衡二叉树
+    // 有序数组转平衡二叉树
     TreeNode* getTree(vector<int>& nums, int left, int right) {
         if (left > right) return nullptr;
         int mid = left + ((right - left) / 2);
@@ -78,7 +78,27 @@ public:
 Java：
 
 Python：
-
+```python
+class Solution:
+    def balanceBST(self, root: TreeNode) -> TreeNode:
+        res = []
+        # 有序树转成有序数组
+        def traversal(cur: TreeNode):
+            if not cur: return
+            traversal(cur.left)
+            res.append(cur.val)
+            traversal(cur.right)
+        # 有序数组转成平衡二叉树
+        def getTree(nums: List, left, right):
+            if left > right: return 
+            mid = left + (right -left) // 2
+            root = TreeNode(nums[mid])
+            root.left = getTree(nums, left, mid - 1)
+            root.right = getTree(nums, mid + 1, right)
+            return root
+        traversal(root)
+        return getTree(res, 0, len(res) - 1)
+```
 Go：
 
 JavaScript：