From b51573efa69a3e4fead79bbcba62c77f7ecedb09 Mon Sep 17 00:00:00 2001
From: eeee0717 <70054568+eeee0717@users.noreply.github.com>
Date: Wed, 15 Nov 2023 09:16:04 +0800
Subject: [PATCH] =?UTF-8?q?Update101.=E5=AF=B9=E7=A7=B0=E4=BA=8C=E5=8F=89?=
 =?UTF-8?q?=E6=A0=91=EF=BC=8C=E6=B7=BB=E5=8A=A0C#=E7=89=88?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 problems/0101.对称二叉树.md | 47 ++++++++++++++++++++++++++++++++
 1 file changed, 47 insertions(+)

diff --git a/problems/0101.对称二叉树.md b/problems/0101.对称二叉树.md
index 36b39740..1b777dd5 100644
--- a/problems/0101.对称二叉树.md
+++ b/problems/0101.对称二叉树.md
@@ -897,6 +897,53 @@ impl Solution {
     }
 }
 ```
+### C#
+```C#
+// 递归
+public bool IsSymmetric(TreeNode root)
+{
+    if (root == null) return true;
+    return Compare(root.left, root.right);
+}
+public bool Compare(TreeNode left, TreeNode right)
+{
+    if(left == null && right != null) return false;
+    else if(left != null && right == null ) return false;
+    else if(left == null && right == null) return true;
+    else if(left.val != right.val) return false;
+
+    var outside = Compare(left.left, right.right);
+    var inside = Compare(left.right, right.left);
+
+    return outside&&inside;
+}
+```
+``` C#
+// 迭代法
+public bool IsSymmetric(TreeNode root)
+{
+    if (root == null) return true;
+    var st = new Stack<TreeNode>();
+    st.Push(root.left);
+    st.Push(root.right);
+    while (st.Count != 0)
+    {
+        var left = st.Pop();
+        var right = st.Pop();
+        if (left == null && right == null)
+            continue;
+
+        if ((left == null || right == null || (left.val != right.val)))
+            return false;
+
+        st.Push(left.left);
+        st.Push(right.right);
+        st.Push(left.right);
+        st.Push(right.left);
+    }
+    return true;
+}
+```
 
 <p align="center">
 <a href="https://programmercarl.com/other/kstar.html" target="_blank">