From 39f313ff0cec5c1ca94d56116a6b78f15882a56a Mon Sep 17 00:00:00 2001
From: wjjiang <48505670+Spongecaptain@users.noreply.github.com>
Date: Thu, 29 Jul 2021 11:44:51 +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

Go 中函数应该为小写 与 leetcode 保持一致。
---
 problems/二叉树的递归遍历.md | 6 +++---
 1 file changed, 3 insertions(+), 3 deletions(-)

diff --git a/problems/二叉树的递归遍历.md b/problems/二叉树的递归遍历.md
index 2b5a44dd..220ccf65 100644
--- a/problems/二叉树的递归遍历.md
+++ b/problems/二叉树的递归遍历.md
@@ -222,7 +222,7 @@ Go：
 
 前序遍历:
 ```go
-func PreorderTraversal(root *TreeNode) (res []int) {
+func preorderTraversal(root *TreeNode) (res []int) {
     var traversal func(node *TreeNode)
     traversal = func(node *TreeNode) {
 	if node == nil {
@@ -240,7 +240,7 @@ func PreorderTraversal(root *TreeNode) (res []int) {
 中序遍历:
 
 ```go
-func InorderTraversal(root *TreeNode) (res []int) {
+func inorderTraversal(root *TreeNode) (res []int) {
     var traversal func(node *TreeNode)
     traversal = func(node *TreeNode) {
 	if node == nil {
@@ -257,7 +257,7 @@ func InorderTraversal(root *TreeNode) (res []int) {
 后序遍历:
 
 ```go
-func PostorderTraversal(root *TreeNode) (res []int) {
+func postorderTraversal(root *TreeNode) (res []int) {
     var traversal func(node *TreeNode)
     traversal = func(node *TreeNode) {
 	if node == nil {