The Trie : A Neglected Data Structure

What is a Trie?

The word trie is an infix of the word “retrieval” because the trie can find a single word in a dictionary with only a prefix of the word. Trie, can support all operations like insert, search, delete in O(n) time where n is length of the word to be processed. They are used for ordered string operations, and is a best data structure for Dictionary and spell Checkers.

There are various variations of tries for e.g. R-way Tries, Ternary Search Tries, Burst Tries, Compact Tries etc. 

R-way 

Construction of R-way Tries

Searching in a R-way Trie

Performance Ananlysis of R-way Tries

oops.....

Solution : Ternary Search Tries

What is Ternary Search Trie?

Applications of Tries

Browsers storing URL History

And Many More....

- Tries are used in IP routing,  where the ability to contain large ranges of values with a few exceptions is particularly suited to the hierarchical organization of IP addresses.

- Today, top search  engines  like Google and Yahoo use a data structure  called Inverted Index for their  matching of queries to the documents and give users the relevant  documents  according  to  their  rank. To build up this kind of data structure efficiently, Tries are used.  

QUESTIONS????