From cfc78c3c57d5d9a8c79df710c36979700fd43064 Mon Sep 17 00:00:00 2001
From: eeee0717 <70054568+eeee0717@users.noreply.github.com>
Date: Fri, 17 Nov 2023 19:33:16 +0800
Subject: [PATCH] =?UTF-8?q?Update111.=E4=BA=8C=E5=8F=89=E6=A0=91=E7=9A=84?=
 =?UTF-8?q?=E6=9C=80=E5=B0=8F=E6=B7=B1=E5=BA=A6=EF=BC=8C=E6=B7=BB=E5=8A=A0?=
 =?UTF-8?q?C#=E7=89=88?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

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

diff --git a/problems/0111.二叉树的最小深度.md b/problems/0111.二叉树的最小深度.md
index c4e55a07..b27df4a6 100644
--- a/problems/0111.二叉树的最小深度.md
+++ b/problems/0111.二叉树的最小深度.md
@@ -708,6 +708,49 @@ impl Solution {
     }
 }
 ```
+### C#
+```C#
+// 递归
+public int MinDepth(TreeNode root)
+{
+    if (root == null) return 0;
+    int left = MinDepth(root.left);
+    int right = MinDepth(root.right);
+    if (root.left == null && root.right != null)
+        return 1+right;
+    else if(root.left!=null && root.right == null)
+        return 1+left;
+        
+    int res = 1 + Math.Min(left, right);
+    return res;
+}
+```
+```C#
+// 迭代
+public int MinDepth(TreeNode root)
+{
+    if (root == null) return 0;
+    int depth = 0;
+    var que = new Queue<TreeNode>();
+    que.Enqueue(root);
+    while (que.Count > 0)
+    {
+        int size = que.Count;
+        depth++;
+        for (int i = 0; i < size; i++)
+        {
+            var node = que.Dequeue();
+            if (node.left != null)
+                que.Enqueue(node.left);
+            if (node.right != null)
+                que.Enqueue(node.right);
+            if (node.left == null && node.right == null)
+                return depth;
+        }
+    }
+    return depth;
+}     
+```
 
 <p align="center">
 <a href="https://programmercarl.com/other/kstar.html" target="_blank">