The cost of an entry is As a result proportional to the length of the key. Attempts might be compressed to eliminate intermediate nodes; this is known as a patricia trie or radix tree. Radix trees can outperform balanced trees, specifically when many keys share a typical prefix. In 2001, Hech