Trie Data Structure and implementation to insert,search, count, delete words from trie
Trie is a tree data structure which is used widely in google autocomplete, spell checker and prefix matching for ip routing in IP tables. It is also a very efficient data structure compared to hashtable in terms of storing and searching the strings...
