From ea9dfb9d54573b6b847d69b81bc6236397768019 Mon Sep 17 00:00:00 2001
From: wu xiangkai <wuxiangkai@yonyou.com>
Date: Wed, 29 Oct 2025 16:29:12 +0800
Subject: [PATCH] =?UTF-8?q?feat:=202025-10-29=E6=89=93=E5=8D=A1?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 100.same-tree.java      | 35 +++++++++++++++++++++++++++++++++++
 101.symmetric-tree.java | 39 +++++++++++++++++++++++++++++++++++++++
 2 files changed, 74 insertions(+)
 create mode 100644 100.same-tree.java
 create mode 100644 101.symmetric-tree.java

diff --git a/100.same-tree.java b/100.same-tree.java
new file mode 100644
index 0000000..b82fcdf
--- /dev/null
+++ b/100.same-tree.java
@@ -0,0 +1,35 @@
+/*
+ * @lc app=leetcode id=100 lang=java
+ *
+ * [100] Same Tree
+ */
+
+// @lc code=start
+/**
+ * Definition for a binary tree node.
+ * public class TreeNode {
+ *     int val;
+ *     TreeNode left;
+ *     TreeNode right;
+ *     TreeNode() {}
+ *     TreeNode(int val) { this.val = val; }
+ *     TreeNode(int val, TreeNode left, TreeNode right) {
+ *         this.val = val;
+ *         this.left = left;
+ *         this.right = right;
+ *     }
+ * }
+ */
+class Solution {
+    public boolean isSameTree(TreeNode p, TreeNode q) {
+        if(p == null || q == null) {
+            return p == q;
+        }
+        if(p.val != q.val) {
+            return false;
+        }
+        return isSameTree(p.left, q.left) && isSameTree(p.right, q.right);
+    }
+}
+// @lc code=end
+
diff --git a/101.symmetric-tree.java b/101.symmetric-tree.java
new file mode 100644
index 0000000..7be2dbb
--- /dev/null
+++ b/101.symmetric-tree.java
@@ -0,0 +1,39 @@
+/*
+ * @lc app=leetcode id=101 lang=java
+ *
+ * [101] Symmetric Tree
+ */
+
+// @lc code=start
+/**
+ * Definition for a binary tree node.
+ * public class TreeNode {
+ *     int val;
+ *     TreeNode left;
+ *     TreeNode right;
+ *     TreeNode() {}
+ *     TreeNode(int val) { this.val = val; }
+ *     TreeNode(int val, TreeNode left, TreeNode right) {
+ *         this.val = val;
+ *         this.left = left;
+ *         this.right = right;
+ *     }
+ * }
+ */
+class Solution {
+    public boolean isSymmetric(TreeNode root) {
+        return root == null ? true: isMirror(root.left, root.right);
+    }
+
+    private boolean isMirror(TreeNode l, TreeNode r) {
+        if(l == null || r == null) {
+            return l == r;
+        }
+        if(l.val != r.val) {
+            return false;
+        }
+        return isMirror(l.left, r.right) &&isMirror(l.right, r.left);
+    }
+}
+// @lc code=end
+