We introduced and discussed an implementation in below post.
The implementation used in above post uses an array of alphabet size with every node. It can be made memory efficient. One way to implementing Trie is linked set of nodes, where each node contains an array of child pointers, one for each symbol in the alphabet. This is not efficient in terms of time as we can’t quickly find a particular child.
The efficient way is an implementation where we use hash map to store children of a node. Now we allocate memory only for alphabets in use, and don’t waste space storing null pointers.
1 1 0 1 1
Space used here with every node here is proportional to number of children which is much better than proportional to alphabet size, especially if alphabet is large.
This article is contributed by Pranav. If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to firstname.lastname@example.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.
Please write comments if you find anything incorrect, or you want to share more information about the topic discussed above.
- Boggle | Set 2 (Using Trie)
- Trie | (Delete)
- Trie | (Display Content)
- Search in a trie Recursively
- Insertion in a Trie recursively
- Implement a Dictionary using Trie
- Bottom-up traversal of a Trie
- Trie | (Insert and Search)
- Persistent Trie | Set 1 (Introduction)
- Advantages of Trie Data Structure
- Counting the number of words in a Trie
- Longest Common Prefix using Trie
- Auto-complete feature using Trie
- Pattern Searching using a Trie of all Suffixes
- Program for assigning usernames using Trie