Same Tree

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.

check whether p.val==q.val, then recursively check left subtree and right subtree.

public boolean isSameTree(TreeNode p, TreeNode q) {
        if (p==null) {
            return q==null;
        }

        if (q==null) {
            return false;
        }

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

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