📚 dsaflash.cards
Problems
Log in
Sign up
Home
/
Advanced Data Structures
/
Tries and String Structures
Tries and String Structures
Question 1 of 6
What is the time complexity of inserting a word into a trie?
A
O(n), where n is the number of words already in the trie
B
O(log n), where n is the number of nodes in the trie
C
O(n × k), where n is the number of words and k is average word length
D
O(k), where k is the length of the word being inserted
← Back to categories