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

Merge pull request #1237 from Guacker/master

Browse Source 
修改_474_lines_(402_sloc)_e二叉树的递归遍历_c语言前序遍历
This commit is contained in:
程序员Carl
2022-05-07 09:25:17 +08:00
committed by GitHub
parent eebaf964d8 0375a5b147
commit feaea1bfda
1 changed files with 4 additions and 4 deletions
Download Patch File Download Diff File Expand all files Collapse all files

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

@ -371,18 +371,18 @@ C:
```c ```c
//前序遍历： //前序遍历：
void preOrderTraversal(struct TreeNode* root, int* ret, int* returnSize) { void preOrder(struct TreeNode* root, int* ret, int* returnSize) {
if(root == NULL) if(root == NULL)
return; return;
ret[(*returnSize)++] = root->val; ret[(*returnSize)++] = root->val;
preOrderTraverse(root->left, ret, returnSize); preOrder(root->left, ret, returnSize);
preOrderTraverse(root->right, ret, returnSize); preOrder(root->right, ret, returnSize);
} }
int* preorderTraversal(struct TreeNode* root, int* returnSize){ int* preorderTraversal(struct TreeNode* root, int* returnSize){
int* ret = (int*)malloc(sizeof(int) * 100); int* ret = (int*)malloc(sizeof(int) * 100);
*returnSize = 0; *returnSize = 0;
preOrderTraversal(root, ret, returnSize); preOrder(root, ret, returnSize);
return ret; return ret;
} }