DAY15P1.md

Same Tree

---

• Question:

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:

Input: p = [1,2,3], q = [1,2,3]

Output: true

---

• Solution:

Code :

class Solution {
    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;
    }
}