When an array of pointers is used to implement a trie, the time complexity of a search is O$($kn$),$ where k is the number of strings in the trie and n is the length of the longest string.