From 8945fd98094efe154431cb51a7edf01e3b50af60 Mon Sep 17 00:00:00 2001
From: eeee0717 <70054568+eeee0717@users.noreply.github.com>
Date: Sat, 11 Nov 2023 09:12:17 +0800
Subject: [PATCH] =?UTF-8?q?Update.=E4=BA=8C=E5=8F=89=E6=A0=91=E7=9A=84?=
 =?UTF-8?q?=E9=80=92=E5=BD=92=E9=81=8D=E5=8E=86=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/二叉树的递归遍历.md | 54 ++++++++++++++++++++++++++++
 1 file changed, 54 insertions(+)

diff --git a/problems/二叉树的递归遍历.md b/problems/二叉树的递归遍历.md
index 730b18ac..6dad6e56 100644
--- a/problems/二叉树的递归遍历.md
+++ b/problems/二叉树的递归遍历.md
@@ -565,6 +565,60 @@ impl Solution {
 }
 ```
 
+### C#
+```C#
+// 前序遍历
+public IList<int> PreorderTraversal(TreeNode root)
+{
+    var res = new List<int>();
+    if (root == null) return res;
+    Traversal(root, res);
+    return res;
+
+}
+public void Traversal(TreeNode cur, IList<int> res)
+{
+    if (cur == null) return;
+    res.Add(cur.val);
+    Traversal(cur.left, res);
+    Traversal(cur.right, res);
+}
+```
+```C#
+// 中序遍历
+public IList<int> InorderTraversal(TreeNode root)
+{
+    var res = new List<int>();
+    if (root == null) return res;
+    Traversal(root, res);
+    return res;
+}
+public void Traversal(TreeNode cur, IList<int> res)
+{
+    if (cur == null) return;
+    Traversal(cur.left, res);
+    res.Add(cur.val);
+    Traversal(cur.right, res);
+}
+```
+```C#
+// 后序遍历
+public IList<int> PostorderTraversal(TreeNode root)
+{
+    var res = new List<int>();
+    if (root == null) return res;
+    Traversal(root, res);
+    return res;
+}
+public void Traversal(TreeNode cur, IList<int> res)
+{
+    if (cur == null) return;
+    Traversal(cur.left, res);
+    Traversal(cur.right, res);
+    res.Add(cur.val);
+}
+```
+
 <p align="center">
 <a href="https://programmercarl.com/other/kstar.html" target="_blank">
   <img src="../pics/网站星球宣传海报.jpg" width="1000"/>