树的同构啊

input:
8
A 1 2
B 3 4
C 5 -
D - -
E 6 -
G 7 -
F - -
H - -
8
G - 4
B 7 6
F - -
A 5 1
H - -
C 0 -
D - -
E 2 -
output:
Yes
(测试数据对应图1)

#include<stdio.h>
#include<stdlib.h>
typedef struct node
{
    char data;
    int l;
    int r;
}tree;
tree T1[10], T2[10];
int build(tree T[], int n)
{
    int root = -1;
    char a[2], cl[2], cr[2];
    int check[10] = {0};
    if(n)
    {
        for(int i = 0; i < n; i ++)
        {
            scanf("%s%s%s", a, cl, cr);
            T[i].data = a[0];
            if(cl[0] != '-')
            {
                T[i].l = cl[0] - 48;
                check[T[i].l] = 1;
            }
            else
                T[i].l = -1;
            if(cr[0] != '-')
            {
                T[i].r = cr[0] - 48;
                check[T[i].r] = 1;
            }
            else
                T[i].r = -1;
        }
        for(int i = 0; i < n; i ++)
        {
            if(!check[i])
            {
                root = i;
                break;
            }
        }
    }
    return root;
}
int cmp(int r1, int r2)
{
    if(r1 == -1 && r2 == -1)
        return 1;
    if((r1 == -1 &&r2 != -1) || (r1 != -1&&r2 == -1))
        return 0;
    if(T1[r1].data != T2[r2].data)
        return 0;
    if(T1[r1].l == -1 &&T2[r2].l == -1)
        return cmp(T1[r1].r, T2[r2].r);
    if(T1[r1].l != -1 &&T2[r2].l != -1&&T1[T1[r1].l].data == T2[T2[r2].l].data)
        return (cmp(T1[r1].l, T2[r2].l) && cmp(T1[r1].r, T2[r2].r));
    else
        return (cmp(T1[r1].r, T2[r2].l) && cmp(T1[r1].l, T2[r2].r));
}
int main()
{
    int n, m;
    int r1, r2;
    while(~scanf("%d", &n))
    {
        r1 = build(T1, n);
        scanf("%d", &m);
        r2 = build(T2, m);
        if(cmp(r1, r2))
            printf("Yes\n");
        else
            printf("No\n");
    }
    return 0;
}