Trie data structure...

I'm learning Trie and I want a quick start. Any good link?

I have a choice to implement a Trie data structure using either reference-base ADT or index-base ADT. Which one is more efficient and which one is easier to implement?

I'm suppose to insert new entry into my trie. However, an optional requirement states that I should also be able to delete entry from my trie. How difficult would that be? I know that deletion is not an efficient task for trie since it's not suitable for data that is manipulated often. But is the implmentation hard?

By the way, I have to write everything on my own, so I wouldn't be able to borrow any data structure from the util package.

[704 byte] By [dumbucataclysmsh] at [2007-9-30 10:49:57]