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

最新推荐文章于 2020-06-30 11:52:16 发布

wangyangtao

最新推荐文章于 2020-06-30 11:52:16 发布

阅读量2.2k

点赞数 1

分类专栏： c 文章标签： struct character null tree input buffer

本文链接：https://blog.youkuaiyun.com/wangyangtao/article/details/6211609

版权

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

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

#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 = talloc(); /* make a new node */ p->word = strdup(w); p->count = 1; p->left = p->right = NULL; } else if ((cond = strcmp(w, p->word)) == 0) p->count++; /* repeated word */ else if (cond < 0) /* less than into left subtree */ p->left