简单Trie树

#include <iostream>
#include <cstring>
#include <cstdio>
using namespace std;

const int maxn=500010;

int num;
int root[maxn];
int degree[maxn];

typedef struct trie
{
    int cnt;
    int exist;
    trie *data[27];
} trie,*Trie;

int Find(int x)
{
    while(x!=root[x])
    {
        x=root[x];
    }
    return x;
}

void Union(int x,int y)
{
    int fx=Find(x);
    int fy=Find(y);
    root[fx]=fy;
}

void reset(Trie &head)
{
    head=new trie;
    head->cnt=0;
    head->exist=0;
    memset(head->data,0,sizeof(head->data));
}

void Insert(char *s,Trie &head)
{
    int pos;
    Trie node=head; /// 记录原地址

    while(*s)
    {
        pos=*s-97;
        if (head->data[pos] == NULL)
        {
            reset(head->data[pos]);
        }
        head=head->data[pos];
        head->cnt++;
        s++;
    }
    num++;
    head->exist=num;
    head=node; ///？？
}

int Search(char *s,Trie head) /// 不引用 不改变head地址
{
    int pos;

    while(*s)
    {
        pos=*s-97;
        if(head->data[pos] == NULL)
        {
            return -1;
        }
        s++;
        head=head->data[pos];
    }

    if (head->exist != 0)
    {
        return head->exist;
    }
    return -1;
}

int main()
{
    char sx[22],sy[22];
    int x,y,i;
    num=0;
    Trie head;
    reset(head);
    for (i=0; i<=maxn; i++)
    {
        root[i]=i;
        degree[i]=0;
    }
    ///初始化结束
    while(~scanf("%s%s",sx,sy))
    {
        x=Search(sx,head);
        if (x==-1)
        {
            Insert(sx,head);
            x=num;
        }

        if(strcmp(sx,sy)==0)
        {
            y=x;
        }
        else
        {
            y=Search(sy,head);
            if(y==-1)
            {
                Insert(sy,head);
                y=num;
            }
        }

        Union(x,y);
        degree[x]++;
        degree[y]++;
    }
    if(num==0)
    {
        printf("Possible\n");

        return 0;
    }
    int father=0; ///先判断是不是联通
    for(i=1; i<=num; i++)
    {
        if (root[i] == i)
        {
            father++;
        }
    }
    int sum=0; ///奇数度的点的个数
    if (father == 1) ///如果联通 则判断是否存在欧拉回路
    {
        for(i=1; i<=num; i++)
        {
            if(degree[i]%2==1)
            {
                sum++;
            }
        }
    }
    if ((sum==0||sum==2)&&(father==1)) ///存在欧拉回路 则存在0/2个奇数度的点
    {
        printf("Possible\n");
    }
    else
    {
        printf("Impossible\n");
    }
    return 0;
}