Trie

A Trie is a prefix based, ordered tree data structure.  They are quite fast and sometimes superior to hash tables.  They are quite useful for querying substrings, routing prefixes or grabbing all matching sub-variants.  Here's a python implementation.

Brendan Tuesday 20 December 2011 at 10:24 am | | Notes

Tag Cloud