The price of an accessibility is thus proportional into the duration of the key. Attempts might be compressed to remove intermediate nodes; this is called a patricia trie or radix tree. Radix trees can outperform well balanced trees, significantly when a lot of keys share a typical prefix. In