/**
* Definition for binary tree
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode(int x) : val(x), left(NULL), right(NULL) {}
* };
*/
class Solution {
public:
bool isSameTree(TreeNode *p, TreeNode *q) {
if(p==NULL&&q==NULL) return true;
if(p==NULL&&q) return false;
if(p&&q==NULL) return false;
bool left=isSameTree(p->left,q->left);
bool right=isSameTree(p->right,q->right);
return left&&right&&(p->val==q->val);
}
};
* Definition for binary tree
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode(int x) : val(x), left(NULL), right(NULL) {}
* };
*/
class Solution {
public:
bool isSameTree(TreeNode *p, TreeNode *q) {
if(p==NULL&&q==NULL) return true;
if(p==NULL&&q) return false;
if(p&&q==NULL) return false;
bool left=isSameTree(p->left,q->left);
bool right=isSameTree(p->right,q->right);
return left&&right&&(p->val==q->val);
}
};