From 51edb80d7c8771b0b9af932a577daeb658efd100 Mon Sep 17 00:00:00 2001
From: "qingyi.liu" <qingyival@163.com>
Date: Tue, 1 Jun 2021 14:20:54 +0800
Subject: [PATCH] =?UTF-8?q?=E6=B7=BB=E5=8A=A0=20111.=E4=BA=8C=E5=8F=89?=
 =?UTF-8?q?=E6=A0=91=E7=9A=84=E6=9C=80=E5=B0=8F=E6=B7=B1=E5=BA=A6=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

---
 problems/0111.二叉树的最小深度.md | 58 +++++++++++++++++++++++
 1 file changed, 58 insertions(+)

diff --git a/problems/0111.二叉树的最小深度.md b/problems/0111.二叉树的最小深度.md
index 8ee15eac..48795722 100644
--- a/problems/0111.二叉树的最小深度.md
+++ b/problems/0111.二叉树的最小深度.md
@@ -301,6 +301,64 @@ class Solution:
 
 Go：
 
+```go
+/**
+ * Definition for a binary tree node.
+ * type TreeNode struct {
+ *     Val int
+ *     Left *TreeNode
+ *     Right *TreeNode
+ * }
+ */
+func min(a, b int) int {
+    if a < b {
+        return a;
+    }
+    return b;
+}
+// 递归
+func minDepth(root *TreeNode) int {
+    if root == nil {
+        return 0;
+    }
+    if root.Left == nil && root.Right != nil {
+        return 1 + minDepth(root.Right);
+    }
+    if root.Right == nil && root.Left != nil {
+        return 1 + minDepth(root.Left);
+    }
+    return min(minDepth(root.Left), minDepth(root.Right)) + 1;
+}
+
+// 迭代
+
+func minDepth(root *TreeNode) int {
+    dep := 0;
+    queue := make([]*TreeNode, 0);
+    if root != nil {
+        queue = append(queue, root);
+    }
+    for l := len(queue); l > 0; {
+        dep++;
+        for ; l > 0; l-- {
+            node := queue[0];
+            if node.Left == nil && node.Right == nil {
+                return dep;
+            }
+            if node.Left != nil {
+                queue = append(queue, node.Left);
+            }
+            if node.Right != nil {
+                queue = append(queue, node.Right);
+            }
+            queue = queue[1:];
+        }
+        l = len(queue);
+    } 
+    return dep;
+}
+```
+
 
 JavaScript: