Practice
Learn
← Quit
0 / 0 correct
Data Structures
Medium
1 of 20
What is the time to search a trie for a word of length m?
A
O(log n)
B
O(m log n)
C
O(n)
D
O(m), independent of how many words are stored