二叉树实现输入单词按字典顺序排序

最新推荐文章于 2025-08-12 09:59:59 发布

原创

最新推荐文章于 2025-08-12 09:59:59 发布 · 2.2k 阅读

2 ·

CC 4.0 BY-SA版权

文章标签：

#struct #character #null #tree #input #buffer

该程序使用二叉树结构对输入的单词进行处理，按单词的前六个字母（可调整）进行字典序排序，并只显示相同前缀的单词。通过添加、遍历二叉树来实现这一功能。

#include "stdafx.h" #include <stdlib.h> struct tnode { /* the tree node: */ char *word; /* points to the text */ int count; /* number of occurrences */ struct tnode *left; /* left child */ struct tnode *right; /* right child */ }; #include <stdio.h> #include <ctype.h> #include <string.h> #define MAXWORD 100 struct tnode *addtree(struct tnode *, char *); void treeprint(struct tnode *); int getword(char *, int); /* word frequency count */ int main() { struct tnode *root; char word[MAXWORD]; root = NULL; while (getword(word, MAXWORD) != EOF) if (isalpha(word[0])) root = addtree(root, word); treeprint(root); system("pause"); return 0; } struct tnode *talloc(void); char *strdup(char *); /* addtree: add a node with w, at or below p */ struct tnode *addtree(struct tnode *p, char *w) { int cond; if (p == NULL) { /* a new word has arrived */ p