From b769dfabaeae90a45d4f69200720e59304db88c1 Mon Sep 17 00:00:00 2001
From: sujin0529 <201802150@o.cnu.ac.kr>
Date: Fri, 20 Nov 2020 03:57:17 +0900
Subject: [PATCH 1/5] update README file with Same-Tree problem
---
README.md | 2 +-
1 file changed, 1 insertion(+), 1 deletion(-)
diff --git a/README.md b/README.md
index eb7e9551..02c1c1d5 100644
--- a/README.md
+++ b/README.md
@@ -228,7 +228,7 @@ Check out ---> [Sample PR](https://github.com/codedecks-in/LeetCode-Solutions/pu
| # | Title | Solution | Time | Space | Difficulty | Tag | Note |
| ---- | --------------------------------------------------------------------------------------------------------------- | ---------------------------------------------------------------------------------------------------------------- | ----------- | ----------- | ---------- | ---------------------------------------------- | ---- |
| 094 | [Binary Tree Inorder Traversal](https://leetcode.com/problems/binary-tree-inorder-traversal/) | [Java](./Java/binary-tree-inorder-traversal.java)
[Python](./Python/Iterative-Inorder-tree-traversal) | _O(n)_ | _O(logn)_ | Medium | Binary Tree, Stack, HashTable | |
-| 100 | [Same Tree](https://leetcode.com/problems/same-tree/) | [Python](./Python/100.SymmetricTree.py) | _O(n)_ | _O(n)_ | Easy | Tree, Depth-first Search | |
+| 100 | [Same Tree](https://leetcode.com/problems/same-tree/) | [Python](./Python/100.SymmetricTree.py)
[Java](./Java/same-tree.java) | _O(n)_ | _O(n)_ | Easy | Tree, Depth-first Search | |
| 101 | [Symmetric Tree](https://leetcode.com/problems/symmetric-tree/) | [Java](./Java/symmetric-tree.java)
[Python](./Python/101.SymmetricTree.py) | _O(n)_ | _O(n)_ | Easy | Tree, Breadth-first Search, Depth-first Search | |
| 144 | [Binary Tree Preorder Traversal](https://leetcode.com/problems/binary-tree-preorder-traversal/) | [Java](./Java/binary-tree-preorder-traversal.java) | _O(n)_ | _O(logn)_ | Medium | Binary Tree, Stack | |
| 145 | [Binary Tree Postorder Traversal](https://leetcode.com/problems/binary-tree-postorder-traversal/) | [Java](./Java/binary-tree-postorder-traversal.java) | _O(n)_ | _O(logn)_ | Hard | Binary Tree, Stack | |
From 2c11094055e6ef89439c85bbf614fc54e0c5085d Mon Sep 17 00:00:00 2001
From: sujin0529 <201802150@o.cnu.ac.kr>
Date: Fri, 20 Nov 2020 03:57:59 +0900
Subject: [PATCH 2/5] create same-tree.java
---
Java/same-tree.java | 40 ++++++++++++++++++++++++++++++++++++++++
1 file changed, 40 insertions(+)
create mode 100644 Java/same-tree.java
diff --git a/Java/same-tree.java b/Java/same-tree.java
new file mode 100644
index 00000000..004d4cb7
--- /dev/null
+++ b/Java/same-tree.java
@@ -0,0 +1,40 @@
+/**
+ * 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 true;
+ }
+ else if (p == null) {
+ return false;
+ }
+ else if (q == null) {
+ return false;
+ }
+ else {
+ if (p.val != q.val) {
+ return false;
+ }
+ else {
+ boolean left = isSameTree(p.left, q.left);
+ boolean right = isSameTree(p.right, q.right);
+
+ return left && right;
+ }
+ }
+ }
+}
From ea4f0300f800aa73d88eb927d80f50852bad9c23 Mon Sep 17 00:00:00 2001
From: sujin0529 <201802150@o.cnu.ac.kr>
Date: Sun, 22 Nov 2020 12:54:33 +0900
Subject: [PATCH 3/5] change file name to Same-Tree.java
---
Java/same-tree.java | 2 ++
1 file changed, 2 insertions(+)
diff --git a/Java/same-tree.java b/Java/same-tree.java
index 004d4cb7..7c3baebe 100644
--- a/Java/same-tree.java
+++ b/Java/same-tree.java
@@ -14,6 +14,7 @@
* }
*/
+
class Solution {
public boolean isSameTree(TreeNode p, TreeNode q) {
if (p == null && q == null) {
@@ -38,3 +39,4 @@ else if (q == null) {
}
}
}
+
From c0a06f441e0ce9bb6c50416a950bc1b92a044dc6 Mon Sep 17 00:00:00 2001
From: sujin0529 <201802150@o.cnu.ac.kr>
Date: Sun, 22 Nov 2020 12:57:39 +0900
Subject: [PATCH 4/5] change file name to Same-Tree.java
---
Java/{same-tree.java => Same-Tree.java} | 0
1 file changed, 0 insertions(+), 0 deletions(-)
rename Java/{same-tree.java => Same-Tree.java} (100%)
diff --git a/Java/same-tree.java b/Java/Same-Tree.java
similarity index 100%
rename from Java/same-tree.java
rename to Java/Same-Tree.java
From 02774f351cb073f493a57801e32d1c35847a95b8 Mon Sep 17 00:00:00 2001
From: sujin0529 <201802150@o.cnu.ac.kr>
Date: Sun, 22 Nov 2020 13:02:31 +0900
Subject: [PATCH 5/5] modify link to Same-Tree.java
---
README.md | 2 +-
1 file changed, 1 insertion(+), 1 deletion(-)
diff --git a/README.md b/README.md
index 02c1c1d5..fe4ebd90 100644
--- a/README.md
+++ b/README.md
@@ -228,7 +228,7 @@ Check out ---> [Sample PR](https://github.com/codedecks-in/LeetCode-Solutions/pu
| # | Title | Solution | Time | Space | Difficulty | Tag | Note |
| ---- | --------------------------------------------------------------------------------------------------------------- | ---------------------------------------------------------------------------------------------------------------- | ----------- | ----------- | ---------- | ---------------------------------------------- | ---- |
| 094 | [Binary Tree Inorder Traversal](https://leetcode.com/problems/binary-tree-inorder-traversal/) | [Java](./Java/binary-tree-inorder-traversal.java)
[Python](./Python/Iterative-Inorder-tree-traversal) | _O(n)_ | _O(logn)_ | Medium | Binary Tree, Stack, HashTable | |
-| 100 | [Same Tree](https://leetcode.com/problems/same-tree/) | [Python](./Python/100.SymmetricTree.py)
[Java](./Java/same-tree.java) | _O(n)_ | _O(n)_ | Easy | Tree, Depth-first Search | |
+| 100 | [Same Tree](https://leetcode.com/problems/same-tree/) | [Python](./Python/100.SymmetricTree.py)
[Java](./Java/Same-Tree.java) | _O(n)_ | _O(n)_ | Easy | Tree, Depth-first Search | |
| 101 | [Symmetric Tree](https://leetcode.com/problems/symmetric-tree/) | [Java](./Java/symmetric-tree.java)
[Python](./Python/101.SymmetricTree.py) | _O(n)_ | _O(n)_ | Easy | Tree, Breadth-first Search, Depth-first Search | |
| 144 | [Binary Tree Preorder Traversal](https://leetcode.com/problems/binary-tree-preorder-traversal/) | [Java](./Java/binary-tree-preorder-traversal.java) | _O(n)_ | _O(logn)_ | Medium | Binary Tree, Stack | |
| 145 | [Binary Tree Postorder Traversal](https://leetcode.com/problems/binary-tree-postorder-traversal/) | [Java](./Java/binary-tree-postorder-traversal.java) | _O(n)_ | _O(logn)_ | Hard | Binary Tree, Stack | |