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

Browse Source 
更新排版以及修改一个错别字
This commit is contained in:
coffeeboy
2024-05-10 10:20:57 +08:00
committed by GitHub
parent c5250faf70
commit 60ec1b83e2
1 changed files with 2 additions and 2 deletions
Download Patch File Download Diff File Expand all files Collapse all files

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

@ -117,7 +117,7 @@ public:
### 后序遍历（迭代法）
再来看后序遍历，先序遍历是中左右，后续遍历是左右中，那么我们只需要调整一下先序遍历的代码顺序，就变成中右左的遍历顺序，然后在反转result数组，输出的结果顺序就是左右中了，如下图：
再来看后序遍历，先序遍历是中左右，后序遍历是左右中，那么我们只需要调整一下先序遍历的代码顺序，就变成中右左的遍历顺序，然后在反转result数组，输出的结果顺序就是左右中了，如下图：
![前序到后序](https://code-thinking-1253855093.file.myqcloud.com/pics/20200808200338924.png)