From 3e6a1b2d35a489300c63733f0163331764b3dbbf Mon Sep 17 00:00:00 2001
From: zjd <12321619+realpeanut@users.noreply.github.com>
Date: Wed, 12 May 2021 11:44:30 +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

---
 problems/二叉树的递归遍历.md | 60 ++++++++++++++--------------
 1 file changed, 30 insertions(+), 30 deletions(-)

diff --git a/problems/二叉树的递归遍历.md b/problems/二叉树的递归遍历.md
index bd3a9e1c..02d4b060 100644
--- a/problems/二叉树的递归遍历.md
+++ b/problems/二叉树的递归遍历.md
@@ -125,17 +125,17 @@ Go：
 前序遍历:
 ```
 func PreorderTraversal(root *TreeNode) (res []int) {
-	var traversal func(node *TreeNode)
-	traversal = func(node *TreeNode) {
-		if node == nil {
-			return
-		}
-		res = append(res,node.Val)
-		traversal(node.Left)
-		traversal(node.Right)
+    var traversal func(node *TreeNode)
+    traversal = func(node *TreeNode) {
+	if node == nil {
+            return
 	}
-	traversal(root)
-	return res
+	res = append(res,node.Val)
+	traversal(node.Left)
+	traversal(node.Right)
+    }
+    traversal(root)
+    return res
 }
 
 ```
@@ -143,34 +143,34 @@ func PreorderTraversal(root *TreeNode) (res []int) {
 
 ```
 func InorderTraversal(root *TreeNode) (res []int) {
-	var traversal func(node *TreeNode)
-	traversal = func(node *TreeNode) {
-		if node == nil {
-			return
-		}
-		traversal(node.Left)
-		res = append(res,node.Val)
-		traversal(node.Right)
+    var traversal func(node *TreeNode)
+    traversal = func(node *TreeNode) {
+	if node == nil {
+		return
 	}
-	traversal(root)
-	return res
+	traversal(node.Left)
+	res = append(res,node.Val)
+	traversal(node.Right)
+    }
+    traversal(root)
+    return res
 }
 ```
 后序遍历:
 
 ```
 func PostorderTraversal(root *TreeNode) (res []int) {
-	var traversal func(node *TreeNode)
-	traversal = func(node *TreeNode) {
-		if node == nil {
-			return
-		}
-		traversal(node.Left)
-		traversal(node.Right)
-    res = append(res,node.Val)
+    var traversal func(node *TreeNode)
+    traversal = func(node *TreeNode) {
+	if node == nil {
+		return
 	}
-	traversal(root)
-	return res
+	traversal(node.Left)
+	traversal(node.Right)
+        res = append(res,node.Val)
+    }
+    traversal(root)
+    return res
 }
 ```