The trie implemented is used as an inverted index for a search engine that is used to query big text documents. The engine will get documents like this:
0 The quick brown fox leaped over the lazy lazy dog
1 Quick brown foxes leaped over lazy dogs for fun
and create the following trie:
Each word stored in the trie has appended in the end a post list, a list, with nodes that contain the id of the document that the word exists and the word frequency on this document.
To compile & execute:
make clean && make
./trie_main
The above will just create our trie, insert some words to it and then print it.