Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

Sign up
Appearance settings

Commit feaea1b

Browse files
Merge pull request youngyangyang04#1237 from Guacker/master
修改_474_lines_(402_sloc)_e二叉树的递归遍历_c语言前序遍历
2 parents eebaf96 + 0375a5b commit feaea1b

File tree

1 file changed

+4
-4
lines changed

1 file changed

+4
-4
lines changed

‎problems/二叉树的递归遍历.md‎

Lines changed: 4 additions & 4 deletions
Original file line numberDiff line numberDiff line change
@@ -371,18 +371,18 @@ C:
371371

372372
```c
373373
//前序遍历:
374-
void preOrderTraversal(struct TreeNode* root, int* ret, int* returnSize) {
374+
void preOrder(struct TreeNode* root, int* ret, int* returnSize) {
375375
if(root == NULL)
376376
return;
377377
ret[(*returnSize)++] = root->val;
378-
preOrderTraverse(root->left, ret, returnSize);
379-
preOrderTraverse(root->right, ret, returnSize);
378+
preOrder(root->left, ret, returnSize);
379+
preOrder(root->right, ret, returnSize);
380380
}
381381

382382
int* preorderTraversal(struct TreeNode* root, int* returnSize){
383383
int* ret = (int*)malloc(sizeof(int) * 100);
384384
*returnSize = 0;
385-
preOrderTraversal(root, ret, returnSize);
385+
preOrder(root, ret, returnSize);
386386
return ret;
387387
}
388388

0 commit comments

Comments
(0)

AltStyle によって変換されたページ (->オリジナル) /