3 ms·

Fixed lookup time. A trie (aka radix tree) 3 levels deep with 1 million entries has the same lookup time as a 3 level deep trie with 5 entries.

• papaf 10y ago
  Isn't the same thing true for a 3 level deep hashmap of hashmaps?
  • SEJeff 10y ago
    See a much better answer than mine: https://news.ycombinator.com/item?id=13108781 https://news.ycombinator.com/item?id=13108781