mirror of
https://github.com/youngyangyang04/leetcode-master.git
synced 2025-07-12 05:20:59 +08:00
更新0110.平衡二叉树中的上次修改的注释
This commit is contained in:
@ -611,7 +611,7 @@ class Solution:
|
|||||||
if node:
|
if node:
|
||||||
stack.append(node) # 中
|
stack.append(node) # 中
|
||||||
stack.append(None)
|
stack.append(None)
|
||||||
# 采用数组进行迭代,先将右子树加入,保证左节点能够先出栈
|
# 采用数组进行迭代,先将右节点加入,保证左节点能够先出栈
|
||||||
if node.right: # 右
|
if node.right: # 右
|
||||||
stack.append(node.right)
|
stack.append(node.right)
|
||||||
if node.left: # 左
|
if node.left: # 左
|
||||||
|
Reference in New Issue
Block a user