From be0ef14cef18a6aeae95872c82dca0221d16f76b Mon Sep 17 00:00:00 2001
From: "qingyi.liu" <qingyival@163.com>
Date: Tue, 1 Jun 2021 12:01:24 +0800
Subject: [PATCH] =?UTF-8?q?=E6=B7=BB=E5=8A=A0=20101.=20=E5=AF=B9=E7=A7=B0?=
 =?UTF-8?q?=E4=BA=8C=E5=8F=89=E6=A0=91=20go=E7=89=88=E6=9C=AC?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 problems/0101.对称二叉树.md | 48 ++++++++++++++++++++++++++++++++
 1 file changed, 48 insertions(+)

diff --git a/problems/0101.对称二叉树.md b/problems/0101.对称二叉树.md
index d8797d30..b58cef2e 100644
--- a/problems/0101.对称二叉树.md
+++ b/problems/0101.对称二叉树.md
@@ -363,6 +363,54 @@ Python：
 
 Go：
 
+```go
+/**
+ * Definition for a binary tree node.
+ * type TreeNode struct {
+ *     Val int
+ *     Left *TreeNode
+ *     Right *TreeNode
+ * }
+ */
+// 递归
+func defs(left *TreeNode, right *TreeNode) bool {
+    if left == nil && right == nil {
+        return true;
+    };
+    if left == nil || right == nil {
+        return false;
+    };
+    if left.Val != right.Val {
+        return false;
+    }
+    return defs(left.Left, right.Right) && defs(right.Left, left.Right);
+}
+func isSymmetric(root *TreeNode) bool {
+    return defs(root.Left, root.Right);
+}
+
+// 迭代
+func isSymmetric(root *TreeNode) bool {
+    var queue []*TreeNode;
+    if root != nil {
+        queue = append(queue, root.Left, root.Right);
+    }
+    for len(queue) > 0 {
+        left := queue[0];
+        right := queue[1];
+        queue = queue[2:];
+        if left == nil && right == nil {
+            continue;
+        }
+        if left == nil || right == nil || left.Val != right.Val {
+            return false;
+        };
+        queue = append(queue, left.Left, right.Right, right.Left, left.Right);
+    }
+    return true;
+}
+```
+
 
 JavaScript
 ```javascript