Create same-tree.java and Updated README.md

Java/Same-Tree.java

@@ -0,0 +1,42 @@
+/**
+ * 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;
+			}
+		}
+	}
+}
+

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) <br> [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)<br>[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)<br>[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                             |      |