What's a Trie, and Why Should You Care?
Continuing my series on underappreciated Perl modules, I introduce Tree::Trie. A Like Hashes, a Trie is a type of dictionary lookup. Unlike Hashes, Tries naturally support sorted return of keys and prefix matching, all while still being fast, even with a million entries.
I blog about Perl.
Like many pointer-based data structures, tries probably aren't useful in Perl without an XS implementation.