Unordered map vs trie


#1

unordered map is better as for every word it uses O(1) time for searching whereas trie uses O(Wordlength)


#2

Bit late to the party but every standard hashing technique takes O(wordlength) to calculate the hash value and hence as long as we have sufficient space, Trie is a better way to go.
Again: avg complexity of a good hash search= O(1)*O(time taken to hash)