diff --git a/problems/0450.删除二叉搜索树中的节点.md b/problems/0450.删除二叉搜索树中的节点.md
index 6b8ab7ed..f11431e0 100644
--- a/problems/0450.删除二叉搜索树中的节点.md
+++ b/problems/0450.删除二叉搜索树中的节点.md
@@ -281,29 +281,28 @@ class Solution {
 ```java
 // 解法2
 class Solution {
-    public TreeNode deleteNode(TreeNode root, int key) {
-        if (root == null) return root;
-        if (root.val == key) {
-            if (root.left == null) {
-                return root.right;
-            }
-            else if (root.right == null) {
-                return root.left;
-            }
-            else{
-                TreeNode cur = root.right;
-                while (cur.left != null) {
-                    cur = cur.left;
-                }
-                cur.left = root.left;
-                root = root.right;
-                return root;
-            }
+  public TreeNode deleteNode(TreeNode root, int key) {
+    if (root == null) return root;
+    if (root.val == key) {
+      if (root.left == null) {
+        return root.right;
+      } else if (root.right == null) {
+        return root.left;
+      } else {
+        TreeNode cur = root.right;
+        while (cur.left != null) {
+          cur = cur.left;
         }
-        if (root.val > key) root.left = deleteNode(root.left, key);
-        if (root.val < key) root.right = deleteNode(root.right, key);
+        cur.left = root.left;
+        root = root.right;
         return root;
+      }
     }
+    if (root.val > key) root.left = deleteNode(root.left, key);
+    if (root.val < key) root.right = deleteNode(root.right, key);
+    return root;
+  }
+}
 ```
 
 ## Python