From: Justin To <tekmc@...>
Date: 2008-06-11T07:44:57+09:00
Subject: Trie data structure

I'm trying to implement a trie data structure for my parsing program
that parses numbers....I'm lost as to what the algorithm would look
like. 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..."

Any help is appreciated!
-- 
Posted via http://www.ruby-forum.com/.