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

Update 算法模板.md

Browse Source 
将深度优先遍历（递归）的第三项前序遍历改为后序遍历
This commit is contained in:
Know More
2021-05-27 08:57:42 +08:00
committed by GitHub
parent b2c04ffbca
commit a3be0d1498
1 changed files with 2 additions and 2 deletions
Download Patch File Download Diff File Expand all files Collapse all files

4
problems/算法模板.md
View File

@ -82,13 +82,13 @@ void traversal(TreeNode* cur, vector<int>& vec) {
traversal(cur->right, vec); // 右 traversal(cur->right, vec); // 右
} }
``` ```
前序遍历（中左右） 后序遍历（左右中）
``` ```
void traversal(TreeNode* cur, vector<int>& vec) { void traversal(TreeNode* cur, vector<int>& vec) {
if (cur == NULL) return; if (cur == NULL) return;
vec.push_back(cur->val); // 中 ，同时也是处理节点逻辑的地方
traversal(cur->left, vec); // 左 traversal(cur->left, vec); // 左
traversal(cur->right, vec); // 右 traversal(cur->right, vec); // 右
vec.push_back(cur->val); // 中 ，同时也是处理节点逻辑的地方
} }
``` ```