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 · Intermediate
8 questions · Question 1 of 8
13%
Multiple Choice
Senior
What are main advantages of Tries over Binary Search Trees (BSTs)?
A
Trie (also called digital tree or prefix tree) is a tree based data structure, which is used for efficient retrieval of a key in a large data set of strings.
B
The following are the main advantages of tries over binary search trees (BSTs): Looking up keys is faster.
C
The following are the main advantages of tries over hash tables: Tries support ordered iteration, whereas iteration over a hash table will result in a pseudorandom order given by the hash function (also, the order of...
D
A hash table can look up individual strings very quickly.
Previous
Next