/**
* 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) {
// Start typing your C/C++ solution below
// DO NOT write int main() function
if(p==NULL && q==NULL)
return true;
if ((p==NULL && q!=NULL)||(p!=NULL && q==NULL))
return false;
if (p->val != q->val) {
return false;
}
bool left;
bool right;
if (p->val == q->val) {
left = isSameTree(p->left, q->left);
right = isSameTree(p->right, q->right);
}
return left&&right;
}
};
* 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) {
// Start typing your C/C++ solution below
// DO NOT write int main() function
if(p==NULL && q==NULL)
return true;
if ((p==NULL && q!=NULL)||(p!=NULL && q==NULL))
return false;
if (p->val != q->val) {
return false;
}
bool left;
bool right;
if (p->val == q->val) {
left = isSameTree(p->left, q->left);
right = isSameTree(p->right, q->right);
}
return left&&right;
}
};