From a57b6385c4ceccb7900cb9dc41a7eb3d6a59d2e5 Mon Sep 17 00:00:00 2001
From: X-shuffle <53906918+X-shuffle@users.noreply.github.com>
Date: Wed, 19 May 2021 10:07:22 +0800
Subject: [PATCH] =?UTF-8?q?=E6=B7=BB=E5=8A=A0=20=E4=BA=8C=E5=8F=89?=
 =?UTF-8?q?=E6=A0=91=E7=9A=84=E8=BF=AD=E4=BB=A3=E9=81=8D=E5=8E=86=20GO?=
 =?UTF-8?q?=E7=89=88=E6=9C=AC?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

添加 二叉树的迭代遍历 GO版本
---
 problems/二叉树的迭代遍历.md | 1 +
 1 file changed, 1 insertion(+)

diff --git a/problems/二叉树的迭代遍历.md b/problems/二叉树的迭代遍历.md
index 10e7e7b4..a1906469 100644
--- a/problems/二叉树的迭代遍历.md
+++ b/problems/二叉树的迭代遍历.md
@@ -205,6 +205,7 @@ func preorderTraversal(root *TreeNode) []int {
 > 迭代法后序遍历
 
 ```go
+//迭代法后序遍历
 //后续遍历：左右中
 //压栈顺序：中右左(按照前序遍历思路)，再反转结果数组
 func postorderTraversal(root *TreeNode) []int {