[LeetCode] Same Tree

Problem:

Given two binary trees, write a function to check if they are equal or not.

Two binary trees are considered equal if they are structurally identical and the nodes have the same value.

Solution:O(n)

public class Solution {
    public static boolean isSameTree(TreeNode p, TreeNode q) {
        if(p == q )
           return true;
        
        if(p == null || q==null)
           return false;
         
        if(p.val != q.val)
           return false;
        
        if(!isSameTree(p.left,q.left) || !isSameTree(p.right,q.right)) 
           return false;
         
         return true;
     }
}