algorithm/leetcode-master
1
0
Fork 0
mirror of https://github.com/youngyangyang04/leetcode-master.git synced 2025-07-10 04:06:51 +08:00
Code Issues Packages Projects Releases Wiki Activity

Update 0701.二叉搜索树中的插入操作.md

Browse Source 
0701.二叉搜索树中的插入操作.md python3 迭代法优化
This commit is contained in:
roylx
2022-10-12 10:19:54 -06:00
committed by GitHub
parent 1744c21d8c
commit 12eb9158c3
1 changed files with 2 additions and 3 deletions
Download Patch File Download Diff File Expand all files Collapse all files

5
problems/0701.二叉搜索树中的插入操作.md
View File

@ -337,16 +337,15 @@ class Solution:
def insertIntoBST(self, root: TreeNode, val: int) -> TreeNode: def insertIntoBST(self, root: TreeNode, val: int) -> TreeNode:
if not root: if not root:
return TreeNode(val) return TreeNode(val)
parent = None parent = None # 此步可以省略
cur = root cur = root
# 用while循环不断地找新节点的parent # 用while循环不断地找新节点的parent
while cur: while cur:
parent = cur # 首先保存当前非空节点作为下一次迭代的父节点
if cur.val < val: if cur.val < val:
parent = cur
cur = cur.right cur = cur.right
elif cur.val > val: elif cur.val > val:
parent = cur
cur = cur.left cur = cur.left
# 运行到这意味着已经跳出上面的while循环, # 运行到这意味着已经跳出上面的while循环,