更新0110.平衡二叉树中的上次修改的注释
This commit is contained in:
parent
d6cd5e0cef
commit
507d9e0430
|
|
@ -611,7 +611,7 @@ class Solution:
|
|||
if node:
|
||||
stack.append(node) # 中
|
||||
stack.append(None)
|
||||
# 采用数组进行迭代,先将右子树加入,保证左节点能够先出栈
|
||||
# 采用数组进行迭代,先将右节点加入,保证左节点能够先出栈
|
||||
if node.right: # 右
|
||||
stack.append(node.right)
|
||||
if node.left: # 左
|
||||
|
|
|
|||
Loading…
Reference in New Issue