learning
/
leetcode-master
mirror of https://github.com/youngyangyang04/leetcode-master.git
1
0
Fork 0
Code Issues Packages Projects Releases Wiki Activity

Update 二叉树的迭代遍历.md

This commit is contained in:
jianghongcheng 2023-05-03 19:30:53 -05:00 committed by GitHub
parent dd1da7fc54
commit ce5b335b72
No known key found for this signature in database
GPG Key ID: 4AEE18F83AFDEB23
1 changed files with 6 additions and 2 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

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

@ -258,6 +258,8 @@ 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:
@ -279,6 +281,8 @@ class Solution:
# 取栈顶元素右结点 # 取栈顶元素右结点
cur = cur.right cur = cur.right
return result return result
```
```python
# 后序遍历-迭代-LC145_二叉树的后序遍历 # 后序遍历-迭代-LC145_二叉树的后序遍历
class Solution: class Solution: