What's Trie & Implementation?
Trie Data Structure
Last updated
Was this helpful?
Trie Data Structure
Last updated
Was this helpful?
Was this helpful?
Trie basically comes from the word Retrieval.
The main purpose of this data structure is to retrieve stored information very fast.
A Trie with 4 words
dog
dust
hat
home
Auto-complete feature is implemented by Tries.
Many websites have used auto-complete features, which suggest the user rest of the word, while the user is typing.
Searching for a person's contact number in a contact list is efficiently implemented by Trie. As soon as the user enters letters the application auto-suggests the name of the person.
Tries help to check and correct word spelling entered by the user. In case the user doesn't know the exact spelling it auto-suggests the correct spelling.
A TrieNode in a Trie represents a single alphabet of the word.
In the below example, to insert the word "dog" 3 TrieNodes are used, one for each alphabet.
