Commit faeda4b

authored

Merge pull request youngyangyang04#2733 from shengyufan/master

更新0110平衡二叉树Python3迭代法精简版代码

2 parents 75313fa + 507d9e0 commit faeda4bCopy full SHA for faeda4b

File tree

-3

lines changed

-3

lines changed

Lines changed: 6 additions & 3 deletions

Original file line number	Diff line number	Diff line change
`@@ -609,10 +609,13 @@ class Solution:`
`609`	`609`	`while stack:`
`610`	`610`	`node = stack.pop()`
`611`	`611`	`if node:`
`612`		`- stack.append(node)`
	`612`	`+ stack.append(node)# 中`
`613`	`613`	`stack.append(None)`
`614`		`- if node.left: stack.append(node.left)`
`615`		`- if node.right: stack.append(node.right)`
	`614`	`+ # 采用数组进行迭代,先将右节点加入,保证左节点能够先出栈`
	`615`	`+ if node.right: # 右`
	`616`	`+ stack.append(node.right)`
	`617`	`+ if node.left: # 左`
	`618`	`+ stack.append(node.left)`
`616`	`619`	`else:`
`617`	`620`	`real_node = stack.pop()`
`618`	`621`	`left, right = height_map.get(real_node.left, 0), height_map.get(real_node.right, 0)`

Comments

(0)