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

Update

Browse Source
This commit is contained in:
youngyangyang04
2020-08-04 20:01:28 +08:00
parent d3e1564458
commit 6c104d4fdb
3 changed files with 66 additions and 13 deletions
Download Patch File Download Diff File Expand all files Collapse all files

10
problems/0094.二叉树的中序遍历.md
View File

@@ -11,11 +11,11 @@ https://leetcode-cn.com/problems/binary-tree-inorder-traversal/
```
class Solution {
public:
void traversal(TreeNode* root, vector<int>& vec) {
if (root == NULL) return;
traversal(root->left, vec);
vec.push_back(root->val);
traversal(root->right, vec);
void traversal(TreeNode* cur, vector<int>& vec) {
if (cur == NULL) return;
traversal(cur->left, vec);
vec.push_back(cur->val);
traversal(cur->right, vec);
}
vector<int> inorderTraversal(TreeNode* root) {
vector<int> result;

10
problems/0144.二叉树的前序遍历.md
View File

@@ -11,11 +11,11 @@ https://leetcode-cn.com/problems/binary-tree-preorder-traversal/
```
class Solution {
public:
void traversal(TreeNode* root, vector<int>& vec) {
if (root == NULL) return;
vec.push_back(root->val);
traversal(root->left, vec);
traversal(root->right, vec);
void traversal(TreeNode* cur, vector<int>& vec) {
if (cur == NULL) return;
vec.push_back(cur->val);
traversal(cur->left, vec);
traversal(cur->right, vec);
}
vector<int> preorderTraversal(TreeNode* root) {
vector<int> result;