# Same Tree Leetcode Solution

In this post, we are going to solve the Same Tree Leetcode Solution problem of Leetcode. This Leetcode problem is done in many programming languages like C++, Java, and Python.

## Problem

Given the roots of two binary trees `p` and `q`, 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: p = [1,2,3], q = [1,2,3]
Output: true
```

Example 2:

```Input: p = [1,2], q = [1,null,2]
Output: false
```

Example 3:

```Input: p = [1,2,1], q = [1,1,2]
Output: false
```

Constraints:

• The number of nodes in both trees is in the range `[0, 100]`.
• `-104 <= Node.val <= 104`

Now, lets see the leetcode solution of Same Tree Leetcode Solution.

### Same Tree Leetcode Solution in Python

```class Solution:
def isSameTree(self, p: Optional[TreeNode], q: Optional[TreeNode]) -> bool:
if not p or not q:
return p == q
return p.val == q.val and \
self.isSameTree(p.left, q.left) and \
self.isSameTree(p.right, q.right)
```

### Same Tree Leetcode Solutionin CPP

```class Solution {
public:
bool isSameTree(TreeNode* p, TreeNode* q) {
if (!p || !q)
return p == q;
return p->val == q->val &&
isSameTree(p->left, q->left) &&
isSameTree(p->right, q->right);
}
};
```

### Same Tree Leetcode Solution in Java

```class Solution {
public boolean isSameTree(TreeNode p, TreeNode q) {
if (p == null || q == null)
return p == q;
return p.val == q.val &&
isSameTree(p.left, q.left) &&
isSameTree(p.right, q.right);
}
}
```

Note: This problem Same Tree is generated by Leetcode but the solution is provided by Chase2learn This tutorial is only for Educational and Learning purposes.

Sharing Is Caring