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

Update 二叉树的递归遍历.md

Browse Source 
修改错别字
This commit is contained in:
hailincai
2021-10-24 08:01:53 -04:00
committed by GitHub
parent 3d303eb135
commit 90ed55b5da
1 changed files with 1 additions and 1 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
problems/二叉树的递归遍历.md
View File

@ -54,7 +54,7 @@ traversal(cur->left, vec); // 左
traversal(cur->right, vec); // 右
```
单层递归的逻辑就是按照中左右的顺序来处理的，这样二叉树的前序遍历，基本就写完了，在看一下完整代码：
单层递归的逻辑就是按照中左右的顺序来处理的，这样二叉树的前序遍历，基本就写完了，再看一下完整代码：
前序遍历：