Added : Same Tree

Author: rohitkumar-rk

July LeetCode Challenge/13. Same Tree/Problem Statement.txt

@@ -0,0 +1,31 @@
+Given two binary trees, write a function to check if they are the same or not.
+
+Two binary trees are considered the same if they are structurally identical and the nodes have the same value.
+
+Example 1:
+
+Input:     1         1
+          / \       / \
+         2   3     2   3
+
+        [1,2,3],   [1,2,3]
+
+Output: true
+Example 2:
+
+Input:     1         1
+          /           \
+         2             2
+
+        [1,2],     [1,null,2]
+
+Output: false
+Example 3:
+
+Input:     1         1
+          / \       / \
+         2   1     1   2
+
+        [1,2,1],   [1,1,2]
+
+Output: false

July LeetCode Challenge/13. Same Tree/Solution.java

@@ -0,0 +1,28 @@
+/**
+@lc id : 100
+@problem : Same Tree
+@author : rohit
+@date : 13/07/2020
+@url : https://leetcode.com/problems/same-tree/
+ */
+
+class Solution {
+    
+    public boolean isSameTree(TreeNode p, TreeNode q) {
+        
+        //Both trees are null
+        if(p == null && q == null)
+            return true;
+        
+        //One Tree is null
+        if( (p == null && q != null) || ( p != null && q == null ))
+            return false;
+        
+        //Tree Root has same val
+        if(p.val == q.val)
+            return  isSameTree(p.left, q.left) && isSameTree(p.right, q.right);
+        
+        return false;
+        
+    }
+}