The expense of an access is thus proportional to the length of the key. Tries can be compressed to eliminate intermediate nodes; this is referred to as a patricia trie or radix tree. Radix trees can outperform balanced trees, specifically when many keys share a common prefix. hashmap, Even th