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

#include <stdio.h>
#include <stdlib.h>
struct node
{
    char data;
    int l, r;
}a[15], b[15];
int check(int i, int j)
{
    if(a[a[i].l].data == b[b[j].l].data && a[a[i].r].data == b[b[j].r].data)return 1;
    if(a[a[i].l].data == b[b[j].r].data && a[a[i].r].data == b[b[j].l].data)return 1;
    return 0;
}
int main()
{
    int n, m, i, j, flag;
    char x, y, z;
    while(scanf("%d", &n) != EOF)
    {
        for(i = 0; i < n; i++)
        {
            getchar();
            scanf("%c %c %c", &x, &y, &z);
            a[i].data = x;
            if(y == '-')a[i].l = -1;
            else a[i].l = y - '0';
            if(z == '-')a[i].r = -1;
            else a[i].r = z - '0';
        }
        scanf("%d", &m);
        for(i = 0; i < m; i++)
        {
            getchar();
            scanf("%c %c %c", &x, &y, &z);
            b[i].data = x;
            if(y == '-')b[i].l = -1;
            else b[i].l = y - '0';
            if(z == '-')b[i].r = -1;
            else b[i].r = z - '0';
        }
        if(n != m){printf("No\n");continue;}
        flag = 1;
        for(i = 0; i < n; i++)
        {
            for(j = 0; j < m; j++)
            {
                if(a[i].data == b[j].data)
                {
                    if(check(i, j) == 1){break;}
                    else flag = 0;
                }
            }
            if(j == m){flag = 0;break;}
        }
        if(flag)printf("Yes\n");
        else printf("No\n");
    }
    return 0;
}