typedef struct BinaryTreeNode
{
int data;
BinaryTreeNode *left,*right;
}BinaryTreeNode;
bool IsSameTree(BinaryTreeNode*pRoot1,BinaryTreeNode *pRoot2)//先序每个结点判断是否相等
{
if(pRoot1==NULL&&pRoot2==NULL)
{
return true;
}
if(pRoot1==NULL||pRoot2==NULL)//有一个结点为空,而一个结点不为空肯定不等
{
return false;
}
if(pRoot1->data!=pRoot2->data)
{
return false;
}
return IsSameTree(pRoot1->left,pRoot2->left)&&IsSameTree(pRoot1->right,pRoot2->right);
}