从树根开始判断所有情况
递归实现
int judge(Tree *p,Tree *q)
{
if(!p&&!q)
return 1;
else if(p&&q)
{
if(p->data!=q->data)
return 0;
else
num++;
if((judge(p->lchild,q->lchild)&&judge(p->rchild,q->rchild))||(judge(p->lchild,q->rchild)&&judge(p->rchild,q->lchild)))
return 1;
else
return 0;
}
else
return 0;
}