### LeetCode - Same Tree Solution - The Coding Shala

Home >> LeetCode >> Same Tree

In this post, we will learn how to solve LeetCode's Same Tree problem and will implement its solution in Java.

## Same Tree 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.

Practice this problem on LeetCode.

## LeetCode - Same Tree Java Solution

Approach 1

Using recursion.

Java Program:

```/**
* 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) {
// using recursion

if (p == null && q == null) return true;

if (p == null || q == null) return false;

if (p.val != q.val) return false;

return isSameTree(p.left, q.left) && isSameTree(p.right, q.right);
}
}
```

Other Posts You May Like