/**
* 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) {
if(p == NULL && q == NULL)
return true;
if((p == NULL && q != NULL) || (p != NULL && q == NULL))
return false;
if(p->val == q->val){
if(isSameTree(p->left, q->left) && isSameTree(q->right, p->right))
return true;
else
return false;
}
else
return false;
}
};
递归有点晕,后面再来看看