3340=数据结构实验之二叉树一：树的同构

#include <stdio.h>
#include <stdlib.h>
int n,m;
struct node
{
    char date;
    int left,right;
} tree1[12],tree2[12];
void creat(struct node tree[],int n)
{
    char b[2];
    int i;
    for(i=0; i<n; i++)
    {
        scanf("%s",b);
        tree[i].date = b[0];
        scanf("%s",b);
        if(b[0]=='-') tree[i].left=11;
        else tree[i].left = b[0]-'0';
        scanf("%s",b);
        if(b[0]=='-') tree[i].right=11;
        else tree[i].right = b[0]-'0';
    }
}
int check2(int i,int j)
{
    if(tree1[tree1[i].left].date==tree2[tree2[j].left].date&&tree1[tree1[i].right].date==tree2[tree2[j].right].date)
        return 1;
    if(tree1[tree1[i].right].date==tree2[tree2[j].left].date&&tree1[tree1[i].left].date==tree2[tree2[j].right].date)
        return 1;
    return 0;
}
int check(struct node tree1[],struct node tree2[])
{
    int i,j;
    for(i=0; i<n; i++)
    {
        for(j=0; j<m; j++)
        {
            if(tree1[i].date==tree2[j].date)
            {
                if(check2(i,j)) break;
                else return 0;
            }
        }
        if(j==m) return 0;
    }
    return 1;
}
int main()
{
    while(~scanf("%d",&n))
    {
        creat(tree1,n);
        scanf("%d",&m);
        creat(tree2,m);
        if(m!=n) printf("No
");
        else if(check(tree1,tree2)) printf("Yes
");
        else printf("No
");
    }
    return 0;
}