Beginner
Data Structures & Algorithms
Q28 / 100
What is a trie (prefix tree)?
Correct! Well done.
Incorrect.
The correct answer is B) A tree where each node represents a character and paths represent strings
B
Correct Answer
A tree where each node represents a character and paths represent strings
Explanation
A trie stores strings by sharing common prefixes. Lookup, insert, and delete take O(L) where L is the string length, regardless of how many strings are stored.
Progress
28/100