Justin To wrote:
> Also, I don't fully understand the wikipedia definition at
> http://en.wikipedia.org/wiki/Trie when it says "...no node in the tree
> stores the key associated with that node; instead, its position in the
> tree shows what key it is associated with..."

This web page has an example of data represented as a trie:

http://tinyurl.com/56t7kh

The example is a set of words with each node corresponding to a
character.

There are various ways of implementing these sorts of data structures,
but hashes provide a powerful basis.
-- 
Posted via http://www.ruby-forum.com/.