From 5bf54160131703bff0029272f98626d8717bf41f Mon Sep 17 00:00:00 2001
From: Zehua Ren <48848908+Renzehua1998@users.noreply.github.com>
Date: Thu, 19 Jan 2023 17:40:15 +0800
Subject: [PATCH] =?UTF-8?q?Update=200450.=E5=88=A0=E9=99=A4=E4=BA=8C?=
 =?UTF-8?q?=E5=8F=89=E6=90=9C=E7=B4=A2=E6=A0=91=E4=B8=AD=E7=9A=84=E8=8A=82?=
 =?UTF-8?q?=E7=82=B9.md=20=E6=B7=BB=E5=8A=A0=E6=99=AE=E9=80=9A=E4=BA=8C?=
 =?UTF-8?q?=E5=8F=89=E6=A0=91=E7=9A=84=E5=88=A0=E9=99=A4=E6=96=B9=E5=BC=8F?=
 =?UTF-8?q?python3=E4=BB=A3=E7=A0=81?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 .../0450.删除二叉搜索树中的节点.md  | 18 ++++++++++++++++++
 1 file changed, 18 insertions(+)

diff --git a/problems/0450.删除二叉搜索树中的节点.md b/problems/0450.删除二叉搜索树中的节点.md
index facdb2f9..0655f8c5 100644
--- a/problems/0450.删除二叉搜索树中的节点.md
+++ b/problems/0450.删除二叉搜索树中的节点.md
@@ -348,6 +348,24 @@ class Solution:
         return root
 ```
 
+**普通二叉树的删除方式**
+```python
+class Solution:
+    def deleteNode(self, root: Optional[TreeNode], key: int) -> Optional[TreeNode]:
+        if not root: return root
+        if root.val == key:
+            if not root.right:  # 这里第二次操作目标值：最终删除的作用
+                return root.left
+            tmp = root.right
+            while tmp.left:
+                tmp = tmp.left
+            root.val, tmp.val = tmp.val, root.val  # 这里第一次操作目标值：交换目标值其右子树最左面节点。
+            
+        root.left = self.deleteNode(root.left, key)
+        root.right = self.deleteNode(root.right, key)
+        return root
+```
+
 **迭代法**
 ```python
 class Solution: