Pages tagged trie:

Understanding Ternary Trees | PC Plus
http://www.pcplus.co.uk/node/3074/

ince we m
Ternary trees are the fastest way to search for data strings, at least in hardcore programming terms, but how exactly do they work?
Ruby Algorithms: Sorting, Trie & Heaps - igvita.com
http://www.igvita.com/2009/03/26/ruby-algorithms-sorting-trie-heaps/
Collection of some useful Ruby data structures all coded up and ready for use.