数据结构-链表字典树实现（单词查找树，Trietree)C语言

我不是写算法我在创造世界

于 2021-07-27 16:03:37 发布

阅读量238

点赞数

分类专栏：算法数据结构 C语言文章标签：字符串数据结构链表

本文链接：https://blog.csdn.net/qq_42833078/article/details/119146178

版权

本文介绍了如何使用C语言构建链表字典树，即单词查找树（TrieTree），用于高效地进行字符串查找和操作。详细的概念解释请参阅其他相关资料。

摘要由CSDN通过智能技术生成

字典树的相关概念请查找其他资料，不再累述

#include<stdio.h>
#include<stdlib.h>
#include<string.h>
typedef struct Node{
	char data;
	struct Node* next[26];
}LNode,*LinkList;
LinkList CreateHead();
LinkList AddData(LinkList head,char* word);
bool FindWord(LinkList head,char* word);
int main(){
	LinkList head = CreateHead();
	head = AddData(head,"abcd");
	head = AddData(head,"abce");
	head = AddData(head,"abca");
	head = AddData(head,"bacbe");
	head = AddData(head,"bcc");
	if(FindWord(head,"abcd")) printf("yes\n"); 
	if(FindWord(head,"abce")) printf("yes\n"); 
	if(FindWord(head,"abca")) printf("yes\n"); 
	if(FindWord(head,"bacbe")) printf("yes\n"); 
	if(FindWord(head,"bcc")) printf("yes\n");
	if(FindWord(head,"bbac")) printf("yes");
	else printf("NoFind");
} 
LinkList CreateHead(){
	LinkList head =