/*
运行此程序之前要将写有单词的英文文章以.txt格式保存在d:\word.txt
*/
#include
#include
#include
#include
#include
#include
#define N 20
#define M 100000
#define STACK_INIT_SIZE 100
typedef struct ntree
{
char a[N];
int i;
struct ntree *left;
struct ntree *right;
}tree;
typedef struct WordNumber
{
char a[N];
int i;
struct WordNumber *left;
struct WordNumber *right;
}WN;
typedef struct {
tree **base;
tree **top;
int stacksize;
}sqstack;
int sign=0,sum=0,n;
char ko[N];
WN wonu[M];
int traverse(tree *);
int initstack(sqstack *S);
tree *push(sqstack *s,tree *p);
tree *pop(sqstack *s);
int createtree(tree *,char *,char *,long ,long);
int jfcmp(char *,char *,int);
int sort();
//主函数
int main()
{
tree root;
FILE *fp;
long at,fg;
char ch;
int i;
char t[M],wd[N];
printf(“ 准备扫描文章\n”);
fp=fopen(“d:\\word.txt”, “rt