The expense of an access is thus proportional on the length of the key. Tries is usually compressed to eliminate intermediate nodes; this is named a patricia trie or radix tree. Radix trees can outperform balanced trees, specially when several keys share a standard prefix. $begingroup$ The Bl