304 North Cardinal St.
Dorchester Center, MA 02124

# Same Tree LeetCode Solution

## Problem – Same Tree

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`

### Same Tree LeetCode Solution in Python

``````def isSameTree(self, p, q):
if p and q:
return p.val == q.val and self.isSameTree(p.left, q.left) and self.isSameTree(p.right, q.right)
return p is q``````

### Same Tree LeetCode Solution in Java

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

### Same Tree LeetCode Solution in C++

``````bool 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));
}
``````
##### Same Tree LeetCode Solution Review:

In our experience, we suggest you solve this Same Tree LeetCode Solution and gain some new skills from Professionals completely free and we assure you will be worth it.

If you are stuck anywhere between any coding problem, just visit Queslers to get the Same Tree LeetCode Solution

Find on LeetCode

##### Conclusion:

I hope this Same Tree LeetCode Solution would be useful for you to learn something new from this problem. If it helped you then don’t forget to bookmark our site for more Coding Solutions.

This Problem is intended for audiences of all experiences who are interested in learning about Data Science in a business context; there are no prerequisites.

Keep Learning!

More Coding Solutions >>

LeetCode Solutions

Hacker Rank Solutions

CodeChef Solutions