From a9923f809d7f22b5271a09764788aa6f16fa430e Mon Sep 17 00:00:00 2001
From: eeee0717 <70054568+eeee0717@users.noreply.github.com>
Date: Mon, 20 Nov 2023 09:48:41 +0800
Subject: [PATCH] =?UTF-8?q?Update=200257.=E4=BA=8C=E5=8F=89=E6=A0=91?=
 =?UTF-8?q?=E7=9A=84=E6=89=80=E6=9C=89=E8=B7=AF=E5=BE=84=EF=BC=8C=E6=B7=BB?=
 =?UTF-8?q?=E5=8A=A0C#=E9=80=92=E5=BD=92?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 problems/0257.二叉树的所有路径.md | 37 +++++++++++++++++++++++
 1 file changed, 37 insertions(+)

diff --git a/problems/0257.二叉树的所有路径.md b/problems/0257.二叉树的所有路径.md
index 44c0fd85..9ba165c7 100644
--- a/problems/0257.二叉树的所有路径.md
+++ b/problems/0257.二叉树的所有路径.md
@@ -900,6 +900,43 @@ impl Solution {
     }
 }
 ```
+### C#
+```C#
+public IList<string> BinaryTreePaths(TreeNode root)
+{
+    List<int> path = new();
+    List<string> res = new();
+    if (root == null) return res;
+    Traversal(root, path, res);
+    return res;
+}
+public void Traversal(TreeNode node, List<int> path, List<string> res)
+{
+    path.Add(node.val);
+    if (node.left == null && node.right == null)
+    {
+        string sPath = "";
+        for (int i = 0; i < path.Count - 1; i++)
+        {
+            sPath += path[i].ToString();
+            sPath += "->";
+        }
+        sPath += path[path.Count - 1].ToString();
+        res.Add(sPath);
+        return;
+    }
+    if (node.left != null)
+    {
+        Traversal(node.left, path, res);
+        path.RemoveAt(path.Count-1);
+    }
+    if (node.right != null)
+    {
+        Traversal(node.right, path, res);
+        path.RemoveAt(path.Count-1);
+    }
+}
+```
 
 <p align="center">
 <a href="https://programmercarl.com/other/kstar.html" target="_blank">