From 09013df96a8263dda2ed601acc04e69107ff2b46 Mon Sep 17 00:00:00 2001
From: baici1 <249337001@qq.com>
Date: Thu, 9 Sep 2021 15:52:45 +0800
Subject: [PATCH] =?UTF-8?q?=E6=B7=BB=E5=8A=A0226=E7=BF=BB=E8=BD=AC?=
 =?UTF-8?q?=E5=AD=90=E6=A0=91=20go=E7=89=88=E6=9C=AC=E7=9A=84=E9=80=92?=
 =?UTF-8?q?=E5=BD=92=E5=90=8E=E5=BA=8F=E9=81=8D=E5=8E=86=EF=BC=8C=E8=BF=AD?=
 =?UTF-8?q?=E4=BB=A3=E5=89=8D=E5=90=8E=E5=BA=8F=E9=81=8D=E5=8E=86=EF=BC=8C?=
 =?UTF-8?q?=E5=B1=82=E5=BA=8F=E9=81=8D=E5=8E=86?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 problems/0226.翻转二叉树.md | 94 +++++++++++++++++++++++++++++++-
 1 file changed, 93 insertions(+), 1 deletion(-)

diff --git a/problems/0226.翻转二叉树.md b/problems/0226.翻转二叉树.md
index b69cad55..fb5d831a 100644
--- a/problems/0226.翻转二叉树.md
+++ b/problems/0226.翻转二叉树.md
@@ -363,7 +363,9 @@ class Solution:
         return root
 ```
 
-### Go 
+### Go
+
+递归版本的前序遍历
 
 ```Go
 func invertTree(root *TreeNode) *TreeNode {
@@ -381,6 +383,96 @@ func invertTree(root *TreeNode) *TreeNode {
 }
 ```
 
+递归版本的后序遍历
+
+```go
+func invertTree(root *TreeNode) *TreeNode {
+    if root==nil{
+        return root
+    }
+    invertTree(root.Left)//遍历左节点
+    invertTree(root.Right)//遍历右节点
+    root.Left,root.Right=root.Right,root.Left//交换
+    return root
+}
+```
+
+迭代版本的前序遍历
+
+```go
+func invertTree(root *TreeNode) *TreeNode {
+    stack:=[]*TreeNode{}
+    node:=root
+    for node!=nil||len(stack)>0{
+        for node!=nil{
+            node.Left,node.Right=node.Right,node.Left//交换
+            stack=append(stack,node)
+            node=node.Left
+        }
+        node=stack[len(stack)-1]
+        stack=stack[:len(stack)-1]
+        node=node.Right
+    }
+    return root
+}
+```
+
+迭代版本的后序遍历
+
+```go
+func invertTree(root *TreeNode) *TreeNode {
+    stack:=[]*TreeNode{}
+    node:=root
+    var prev *TreeNode
+    for node!=nil||len(stack)>0{
+        for node!=nil{
+            stack=append(stack,node)
+            node=node.Left
+        }
+        node=stack[len(stack)-1]
+        stack=stack[:len(stack)-1]
+        if node.Right==nil||node.Right==prev{
+            node.Left,node.Right=node.Right,node.Left//交换
+            prev=node
+            node=nil
+        }else {
+            stack=append(stack,node)
+            node=node.Right
+        }
+    }
+    return root
+}
+```
+
+层序遍历
+
+```go
+func invertTree(root *TreeNode) *TreeNode {
+    if root==nil{
+        return root
+    }
+    queue:=list.New()
+    node:=root
+    queue.PushBack(node)
+    for queue.Len()>0{
+        length:=queue.Len()
+        for i:=0;i<length;i++{
+            e:=queue.Remove(queue.Front()).(*TreeNode)
+            e.Left,e.Right=e.Right,e.Left//交换
+            if e.Left!=nil{
+                queue.PushBack(e.Left)
+            }
+            if e.Right!=nil{
+                queue.PushBack(e.Right)
+            }
+        }
+    }
+    return root
+}
+```
+
+
+
 ### JavaScript
 
 使用递归版本的前序遍历