Think of a datastructure where you can search any alphabetic string in the X steps (X = number of characters in string). So basically it can be a tree with 27 childs per internal node. So according to binary search rule and help of one simple link list, this tree can fetch you any string in X steps. So this tree is Trie.
-Regards Amit Agarwal blog.amitagrwal.com On Thu, Jun 24, 2010 at 3:39 PM, Dhritiman Das <[email protected]>wrote: > > Useful links: > http://www.cs.mcgill.ca/~cs251/OldCourses/1997/topic7/<http://www.cs.mcgill.ca/%7Ecs251/OldCourses/1997/topic7/> > http://www.allisons.org/ll/AlgDS/Tree/Trie/ > http://www.allisons.org/ll/AlgDS/Tree/Suffix/ > > On Jun 23, 11:24 pm, Raj N <[email protected]> wrote: > > Hi, > > Can anyone explain me the implementation of trie. I would be grateful > > if one could provide me the link to a good learning resource. > > Thanks!! > > -- > You received this message because you are subscribed to the Google Groups > "Algorithm Geeks" group. > To post to this group, send email to [email protected]. > To unsubscribe from this group, send email to > [email protected]<algogeeks%[email protected]> > . > For more options, visit this group at > http://groups.google.com/group/algogeeks?hl=en. > > -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to [email protected]. To unsubscribe from this group, send email to [email protected]. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
