判断两个树是否相同
/**
* 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!=NULL) return false;
if(p!=NULL&&q==NULL) return false;
if(p->val==q->val)
{
return (isSameTree(p->left,q->left)&&isSameTree(p->right,q->right));//此处是关键,必须同时比较左右儿子
}else{
return false;
}
}
};