/* main prog */ int main( int argc, char **argv ) { char word[ MAX_WORD_LEN ]; Node *tree = NULL; while ( getword( word, MAX_WORD_LEN ) != EOF ) { if ( isalpha( *word ) && !isnoise( word ) ) { tree = addtree( tree, word ); } } treewalk( tree ); treefree( tree ); return 0; }
main() { struct word *root; char word[MAXWORD]; root=NULL; while(getword(word,MAXWORD)!=EOF) if(word[0]=='\n') line++; else if(isnoise(word)==0) root=addtree(root,word,line); treeprint(root); qsort() orderprint(root); return 0; }