From 12eb9158c3b1e7148add297d289176d4543cfb15 Mon Sep 17 00:00:00 2001
From: roylx <73628821+roylx@users.noreply.github.com>
Date: Wed, 12 Oct 2022 10:19:54 -0600
Subject: [PATCH] =?UTF-8?q?Update=200701.=E4=BA=8C=E5=8F=89=E6=90=9C?=
 =?UTF-8?q?=E7=B4=A2=E6=A0=91=E4=B8=AD=E7=9A=84=E6=8F=92=E5=85=A5=E6=93=8D?=
 =?UTF-8?q?=E4=BD=9C.md?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

0701.二叉搜索树中的插入操作.md python3 迭代法优化
---
 problems/0701.二叉搜索树中的插入操作.md | 5 ++---
 1 file changed, 2 insertions(+), 3 deletions(-)

diff --git a/problems/0701.二叉搜索树中的插入操作.md b/problems/0701.二叉搜索树中的插入操作.md
index 06e1c88f..599dd073 100644
--- a/problems/0701.二叉搜索树中的插入操作.md
+++ b/problems/0701.二叉搜索树中的插入操作.md
@@ -337,16 +337,15 @@ class Solution:
     def insertIntoBST(self, root: TreeNode, val: int) -> TreeNode:
         if not root: 
             return TreeNode(val)
-        parent = None
+        parent = None # 此步可以省略
         cur = root
 
         # 用while循环不断地找新节点的parent
         while cur: 
+            parent = cur  # 首先保存当前非空节点作为下一次迭代的父节点
             if cur.val < val: 
-                parent = cur
                 cur = cur.right
             elif cur.val > val: 
-                parent = cur
                 cur = cur.left
 
         # 运行到这意味着已经跳出上面的while循环,