From b1d56c8cffe8fb25fc9bbf7d8f5aa768491bb68d Mon Sep 17 00:00:00 2001
From: eeee0717 <70054568+eeee0717@users.noreply.github.com>
Date: Wed, 22 Nov 2023 10:02:57 +0800
Subject: [PATCH] =?UTF-8?q?Update=200513.=E6=89=BE=E6=A0=91=E5=B7=A6?=
 =?UTF-8?q?=E4=B8=8B=E6=96=B9=E7=9A=84=E5=80=BC=EF=BC=8C=E6=B7=BB=E5=8A=A0?=
 =?UTF-8?q?C#=E9=80=92=E5=BD=92=E7=89=88?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 problems/0513.找树左下角的值.md | 32 ++++++++++++++++++++++++++
 1 file changed, 32 insertions(+)

diff --git a/problems/0513.找树左下角的值.md b/problems/0513.找树左下角的值.md
index 7ef934cc..0e2f4266 100644
--- a/problems/0513.找树左下角的值.md
+++ b/problems/0513.找树左下角的值.md
@@ -684,6 +684,38 @@ impl Solution {
     }
 }
 ```
+### C#
+```C#
+//递归
+int maxDepth = -1;
+int res = 0;
+public int FindBottomLeftValue(TreeNode root)
+{
+    Traversal(root, 0);
+    return res;
+}
+public void Traversal(TreeNode root, int depth)
+{
+    if (root.left == null && root.right == null)
+    {
+        if (depth > maxDepth)
+        {
+            maxDepth = depth;
+            res = root.val;
+        }
+        return;
+    }
+    if (root.left != null)
+    {
+        Traversal(root.left, depth + 1);
+    }
+    if (root.right != null)
+    {
+        Traversal(root.right, depth + 1);
+    }
+    return;
+}
+```
 
 <p align="center">
 <a href="https://programmercarl.com/other/kstar.html" target="_blank">