The expense of an obtain is Therefore proportional into the size of the key. Tries might be compressed to eliminate intermediate nodes; this is known as a patricia trie or radix tree. Radix trees can outperform balanced trees, especially when quite a few keys share a standard prefix. $begingr