字典树模板

/*  2011-09-30
    自己写的字典树模板
    zoj1109：140ms 有待改进 
*/

#include <stdio.h>
#include <stdlib.h>
#include <string.h>

/* Trie define */
#define nodesize 200010
#define wordsize 100010
#define lettsize 11

typedef struct node
{
    char* word;
    node* next[ 26 ];
}tnode;
tnode dict[ nodesize+1 ];
char  lett[ wordsize+1 ][ 11 ];

class Trie
{
    private:
        int    size;
        int    numb;
        tnode* root;
    public:
        Trie() {
            size = 0;
            numb = 0;
            root = newnode();
        }
        tnode* newnode() {
            for ( int i = 0 ; i < 26 ; ++ i )
                dict[ size ].next[ i ] = NULL;
            dict[ size ].word = NULL;
            return &dict[ size ++ ];
        }
        char* newword( char* word ) {
            strcpy( lett[ numb ], word );
            return lett[ numb ++ ];
        }
        void insert( char* word, int l, char* lett ) {
            tnode* now = root;
            for ( int i = 0 ; i < l ; ++ i ) {
                if ( !now->next[ word[ i ]-'a' ] )
                    now->next[ word[ i ]-'a' ] = newnode();
                now = now->next[ word[ i ]-'a' ];
            }now->word = newword( lett );
        }
        char* find( char* word, int l ) {
            tnode* now = root;
            for ( int i = 0 ; i < l ; ++ i ) {
                if ( !now->next[ word[ i ]-'a' ] ) 
                    return false;
                now = now->next[ word[ i ]-'a' ];
            }return now->word;
        }
};
/* Trie  end */

int main()
{
    char temp,word[ 11 ],lett[ 11 ];
    Trie trie;
    while ( scanf("%s%s",lett,word) ) {
        trie.insert( word, strlen( word ), lett );
        getchar();
        if ( ( temp = getchar() ) == '\n' ) break;
        else ungetc( temp, stdin );
    }
    while ( scanf("%s",word) != EOF ) {
        char* base = trie.find( word, strlen( word ) );
        if ( !base ) printf("eh\n");
        else printf("%s\n",base);
    }
    return 0;
}