100. 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. 0ms 37.5% /**  * Definition for a binary tree node.  * struct TreeNode {  *     int val;  *     struct TreeNode *left;  *     struct TreeNode *right;  * };  */ bool isSameTree(struct TreeNode* p, struct TreeNode* q) {     int i,j;     if(q == NULL && p == NULL )         return true;     if(p == NULL && q != NULL )         return false;     if(q == NULL && p != NULL )         return false;     if( p->val != q->val )         return false;     return isSameTree(p->right,q->right) && isSameTree(p->left,q->left); }