open navigation menu
AiFolder
Tools for a smarter you
Discover
Tools
AI
Games
Interviews
Blog
More
Search AiFolder
Toggle theme
Toggle theme
Sign in
Exit
00:00
Submit test
Trie · Advanced
8 questions · Question 1 of 8
13%
Multiple Choice
Mid
Name some application of Trie data structure
A
Some applications of trie data structure include: dictionary lookup prefix searches auto complete feature in text editors command completion in IDE etc phone number/contacts searching IP lookups mapping URLs to operat...
B
The basic form is that of a linked set of nodes, where each node contains an array of child pointers, one for each symbol in the alphabet (so for the English alphabet, one would store 26 child pointers and for the alp...
C
Tries and hash tables are used for different things: If all you want is the ability to lookup a word, then a hash table will be faster.
D
Advantages of Trie: With Trie, we can insert and find strings in O(L) time where L represent the length of a single word.
Previous
Next