edit 100

Author: fishercoder1534

README.md

@@ -456,6 +456,7 @@ Your ideas/fixes/algorithms are more than welcome!
 |103|[Binary Tree Zigzag Level Order Traversal](https://leetcode.com/problems/binary-tree-zigzag-level-order-traversal/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_103.java)| O(n)|O(h) | Medium| BFS,DFS
 |102|[Binary Tree Level Order Traversal](https://leetcode.com/problems/binary-tree-level-order-traversal/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_102.java)| O(n)|O(h) | Medium| BFS
 |101|[Symmetric Tree](https://leetcode.com/problems/symmetric-tree/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_101.java)| O(n)|O(h) | Easy| DFS
+|100|[Same Tree](https://leetcode.com/problems/same-tree/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_100.java)| O(n)|O(h) | Easy| DFS
 |99|[Recover Binary Search Tree](https://leetcode.com/problems/recover-binary-search-tree/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_99.java) | O(?) | O(?) | Hard |
 |98|[Validate Binary Search Tree](https://leetcode.com/problems/validate-binary-search-tree/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_98.java) | O(n) | O(h) | Medium | DFS/Recursion
 |97|[Interleaving String](https://leetcode.com/problems/interleaving-string/)|[Solution](../master/src/main/java/com/fishercoder/solutions/InterleavingString.java)| O(?)|O(?) | Hard| DP

…/com/fishercoder/solutions/SameTree.java …java/com/fishercoder/solutions/_100.javasrc/main/java/com/fishercoder/solutions/SameTree.java renamed to src/main/java/com/fishercoder/solutions/_100.java src/main/java/com/fishercoder/solutions/SameTree.java renamed to src/main/java/com/fishercoder/solutions/_100.java

@@ -7,7 +7,8 @@
 Given two binary trees, write a function to check if they are equal or not.
 
 Two binary trees are considered equal if they are structurally identical and the nodes have the same value. */
-public class SameTree {
+
+public class _100 {
 	//recursion idea flows out naturally.
 	public boolean isSameTree(TreeNode p, TreeNode q) {
 		if(p == null || q == null) return p == q;