xtralib/html/trie_8h_source.html

 #ifndef __XTRA_TRIE_H__

 #define __XTRA_TRIE_H__


 // Default to English

 static int xtTrieNumOfLetters = 26;


 #include <xtra/common.h>


 #include <string.h>

 #include <stdio.h>

 #include <stdlib.h>

 #include <wchar.h>


 typedef struct TrieNode TrieNode;

 struct TrieNode {

     wchar_t data;

     bool is_leaf;

     TrieNode* children[];

 };


 TrieNode * TrieNodeInit(wchar_t data, int numOfLetters);

 void TrieNodeFree(TrieNode *node);


 TrieNode * TrieInsert(TrieNode *root, wchar_t *word);

 TrieNode * TrieDelete(TrieNode *root, wchar_t *word);


 bool TrieSearch(TrieNode *root, wchar_t *word);


 void TriePrint(TrieNode *root);

 bool TriePrintSearch(TrieNode *root, wchar_t *word);


 #endif

string.h
New functions and types related to string and string manipulation.

TrieNode
Definition: trie.h:24

TrieInsert
TrieNode * TrieInsert(TrieNode *root, wchar_t *word)
Inserts word onto the trie.
Definition: trie.c:43

TrieSearch
bool TrieSearch(TrieNode *root, wchar_t *word)
Searches for a given word.
Definition: trie.c:91

TrieDelete
TrieNode * TrieDelete(TrieNode *root, wchar_t *word)
Deletes words from trie. Will try to delete the word sequence from trie only if it ends up in a leaf ...
Definition: trie.c:72