CS_learn/leetcode-master
1
0
Fork 0
mirror of https://github.com/youngyangyang04/leetcode-master.git synced 2026-02-02 18:39:09 +08:00
Code Issues Packages Projects Releases Wiki Activity

替换图片链接

Browse Source
This commit is contained in:
programmercarl
2025-03-17 15:52:23 +08:00
parent 91e7dab72c
commit 86a0208485
216 changed files with 813 additions and 813 deletions
Download Patch File Download Diff File Expand all files Collapse all files

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

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