The expense of an obtain is Consequently proportional for the size of The real 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, especially when many keys share a common prefix. "