/**
* Definition for a binary tree node.
* 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) {
bool res = true;
if (p){
if (!q) return false;
if (p->val != q->val) return false;
else res = isSameTree(p->left, q->left) && isSameTree(p->right, q->right);
}
else if (q) return false;
return res;
}
};
