Warp wrote:
> when a new string is added which already has an existing node in the tree,
> it will benefit from it. 

I think that would work with the caveat that you have to distinguish between 
nodes without a child and nodes whose only child is '\0'.  That is, not all 
your branches will end in a '\0' as shown in the picture. I'd have to think 
harder about the performance implications for failed lookups, too.

-- 
   Darren New, San Diego CA, USA (PST)
   Insanity is a small city on the western
   border of the State of Mind.

Post a reply to this message