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

Merge pull request #2733 from shengyufan/master

Browse Source 
更新0110平衡二叉树Python3迭代法精简版代码
This commit is contained in:
程序员Carl
2024-09-24 10:07:53 +08:00
committed by GitHub
parent 75313fa53c 507d9e0430
commit faeda4b0a2
1 changed files with 6 additions and 3 deletions
Download Patch File Download Diff File Expand all files Collapse all files

9
problems/0110.平衡二叉树.md
View File

@ -609,10 +609,13 @@ class Solution:
while stack: while stack:
node = stack.pop() node = stack.pop()
if node: if node:
stack.append(node) stack.append(node) # 中
stack.append(None) stack.append(None)
if node.left: stack.append(node.left) # 采用数组进行迭代，先将右节点加入，保证左节点能够先出栈
if node.right: stack.append(node.right) if node.right: # 右
stack.append(node.right)
if node.left: # 左
stack.append(node.left)
else: else:
real_node = stack.pop() real_node = stack.pop()
left, right = height_map.get(real_node.left, 0), height_map.get(real_node.right, 0) left, right = height_map.get(real_node.left, 0), height_map.get(real_node.right, 0)