From 0375a5b147c40a449c04ef7f988dfcb2d93b9e01 Mon Sep 17 00:00:00 2001
From: Guacker <92098421+Guacker@users.noreply.github.com>
Date: Sun, 17 Apr 2022 17:19:00 +0800
Subject: [PATCH] =?UTF-8?q?Update=20=E4=BA=8C=E5=8F=89=E6=A0=91=E7=9A=84?=
 =?UTF-8?q?=E9=80=92=E5=BD=92=E9=81=8D=E5=8E=86.md?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

修改了c语言实现的先序遍历函数名 和内部调用时用的函数名
及在preorderTraversal中的调用先序遍历操作的函数名
---
 problems/二叉树的递归遍历.md | 8 ++++----
 1 file changed, 4 insertions(+), 4 deletions(-)

diff --git a/problems/二叉树的递归遍历.md b/problems/二叉树的递归遍历.md
index 35d19d7b..612f2394 100644
--- a/problems/二叉树的递归遍历.md
+++ b/problems/二叉树的递归遍历.md
@@ -371,18 +371,18 @@ C:
 
 ```c
 //前序遍历：
-void preOrderTraversal(struct TreeNode* root, int* ret, int* returnSize) {
+void preOrder(struct TreeNode* root, int* ret, int* returnSize) {
     if(root == NULL)
         return;
     ret[(*returnSize)++] = root->val;
-    preOrderTraverse(root->left, ret, returnSize);
-    preOrderTraverse(root->right, ret, returnSize);
+    preOrder(root->left, ret, returnSize);
+    preOrder(root->right, ret, returnSize);
 }
 
 int* preorderTraversal(struct TreeNode* root, int* returnSize){
     int* ret = (int*)malloc(sizeof(int) * 100);
     *returnSize = 0;
-    preOrderTraversal(root, ret, returnSize);
+    preOrder(root, ret, returnSize);
     return ret;
 }