Why would the Map representation of a Trie be slower than the Array representation?

According to the turorial, the map representation is more flexible, and saves some space, but it might be a little slower than using an array.

Why is that the case, given that both array and map have O1 executation time while inserting and retreiving data.

Comments (2)