/**
* 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 ((q!=NULL && p==NULL) || (q==NULL && p!=NULL)) return false;
return q->val==p->val && isSameTree(p->left, q->left) && isSameTree(p->right, q->right);
}
};
08-04
08-04
08-04
08-04
08-04
08-04