A Patricia Trie, also known as a practical algorithm to retrieve information coded in alphanumeric, is a variant of the radix Trie that compresses entire common parts of the key at the tree nodes. It provides better space usage but worse performance for lookup operations.