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

Update 二叉树的迭代遍历.md

Browse Source
This commit is contained in:
jianghongcheng
2023-05-03 19:30:53 -05:00
committed by GitHub
parent dd1da7fc54
commit ce5b335b72
1 changed files with 6 additions and 2 deletions
Download Patch File Download Diff File Expand all files Collapse all files

8
problems/二叉树的迭代遍历.md
View File

@ -258,7 +258,9 @@ class Solution:
if node.left: if node.left:
stack.append(node.left) stack.append(node.left)
return result return result
```
```python
# 中序遍历-迭代-LC94_二叉树的中序遍历 # 中序遍历-迭代-LC94_二叉树的中序遍历
class Solution: class Solution:
def inorderTraversal(self, root: TreeNode) -> List[int]: def inorderTraversal(self, root: TreeNode) -> List[int]:
@ -279,7 +281,9 @@ class Solution:
# 取栈顶元素右结点 # 取栈顶元素右结点
cur = cur.right cur = cur.right
return result return result
```
```python
# 后序遍历-迭代-LC145_二叉树的后序遍历 # 后序遍历-迭代-LC145_二叉树的后序遍历
class Solution: class Solution:
def postorderTraversal(self, root: TreeNode) -> List[int]: def postorderTraversal(self, root: TreeNode) -> List[int]: