Hi all,
I would like some ideas as to how I would go about developing a trie to store a very small dictionary (of about 10 words). How would I get the program to get each word and make the relevant nodes and edges? Also dela with compressing it?
Thanks for any help in advance.
Do you mean a tree? ;)
I'd say use a map or something along those lines. If there's a java equivalent of the c++ multimap, then go that route.
Do you mean a tree? ;)
I'd say use a map or something along those lines. If there's a java equivalent of the c++ multimap, then go that route.
There is. Here's a handy little link:
The OP wants the tries data structure.
I don't know of any class that supports it.
We're a friendly, industry-focused community of developers, IT pros, digital marketers, and technology enthusiasts meeting, networking, learning, and sharing knowledge.