```cpp
#include<stdio.h>
#define MaxTree 11
#define ElementType char
#define Tree int
#define Null -1
struct TreeNode
{
ElementType Element;
Tree Left;
Tree Right;
}T1[MaxTree],T2[MaxTree];
Tree BuildTree(struct TreeNode T[])
{
int N,i,Root=-1;
int check[11];
char cl,cr;
scanf("%d",&N);
getchar();
for(i=0;i<N;i++)
check[i]=0;
if(!N)
return Null;
if(N)
{
for(i=0;i<N;i++)
{
scanf("%c %c %c",&T[i].Element,&cl,&cr);
getchar();
if(cl!='-')
{
T[i].Left=cl-'0';
check[T[i].Left]=1;
}
else
T[i].Left=Null;
if(cr!='-')
{
T[i].Right=cr-'0';
check[T[i].Right]=1;
}
else
T[i].Right=Null;
}
}
for(i=0;i<N;i++)
if(!check[i])
return i;
}
int Isomorphic(Tree R1,Tree R2)
{
if(R1==Null&&R2==Null)
return 1;
if(R1==Null&&R2!=Null)
return 0;
if(R1!=Null&&R2==Null)
return 0;
if(T1[R1].Element!=T2[R2].Element)
return 0;
if(T1[R1].Left==Null&&T2[R2].Left==Null)
return Isomorphic(T1[R1].Right,T2[R2].Right);
if(T1[R1].Left!=Null&&T2[R2].Left!=Null&&T1[T1[R1].Left].Element==T2[T2[R2].Left].Element)
return Isomorphic(T1[R1].Left,T2[R2].Left)&&Isomorphic(T1[R1].Right,T2[R2].Right);
else
return Isomorphic(T1[R1].Right,T2[R2].Left)&&Isomorphic(T1[R1].Left,T2[R2].Right);
}
int main()
{
Tree R1,R2;
R1=BuildTree(T1);
R2=BuildTree(T2);
if(Isomorphic(R1,R2))
printf("Yes\n");
else
printf("No\n");
return 0;
}
注释
1.CHECK数组的使用非常巧妙,初始时置每个结点CHECK值为0,只要输入到该节点是某个结点
的儿子就将CHECK置为1,最后为0的CHECK值对应根节点(还要确定CHECK哪些结点是在树上的)
2.不要使用atio函数,最好还是利用传统的方法,如char-'0'将字符型转换为整型。
3.同构函数还未完全看懂