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

Update 二叉树的统一迭代法.md 微调 stack 赋值语句

Browse Source
This commit is contained in:
Lane Zhang (张健)
2024-10-24 09:15:07 +08:00
committed by GitHub
parent b8a4613c53
commit a8ac9f9ae0
1 changed files with 2 additions and 2 deletions
Download Patch File Download Diff File Expand all files Collapse all files

4
problems/二叉树的统一迭代法.md
View File

@ -316,7 +316,7 @@ class Solution:
class Solution: class Solution:
def inorderTraversal(self, root: Optional[TreeNode]) -> List[int]: def inorderTraversal(self, root: Optional[TreeNode]) -> List[int]:
values = [] values = []
stack = [] if root is None else [root] stack = [root] if root else []
popped_nodes = set() # 用于记录一个节点是否被 pop() 过 popped_nodes = set() # 用于记录一个节点是否被 pop() 过
while stack: while stack:
@ -345,7 +345,7 @@ class Solution:
class Solution: class Solution:
def postorderTraversal(self, root: Optional[TreeNode]) -> List[int]: def postorderTraversal(self, root: Optional[TreeNode]) -> List[int]:
values = [] values = []
stack = [] if root is None else [root] stack = [root] if root else []
popped_nodes = set() # 用于记录一个节点是否被 pop() 过 popped_nodes = set() # 用于记录一个节点是否被 pop() 过
while stack: while stack: