使用递归算法
bool isSameTree(TreeNode* p, TreeNode* q) {
bool p1, p2;
if(p == NULL & q == NULL)
return true;
else if (p == NULL | q == NULL)
return false;
else if(p->val == q->val)
{
p1 = isSameTree(p->left, q->left);
p2 = isSameTree(p->right, q->right);
return p1 && p2;
}
else
return false;
}