Don, I'm trying to get all the words from trie iteratively, because I'm creating trie of whole dictionary (more than 200k words) and searching recursively will consume a lot of stack space. Thanks for your help!
On Wed, May 29, 2013 at 9:44 AM, rahul sharma <[email protected]>wrote: > > @don u r searching in a previously built trie with the given filter...then > wat is this add fxn doing?correct me if m getting u wrng > > On Wednesday, May 29, 2013, avinesh saini <[email protected]> wrote: > > Thank you Don, I was also trying in similar way. But here I'm confused > how you are storing the traversed words. Are you adding whole words at the > node on which word is ending during insertion. > > > > > > On Wed, May 29, 2013 at 12:36 AM, Don <[email protected]> wrote: > >> > >> void findWords(trie *root, char *filter) > >> { > >> if (!root) return; > >> > >> if (*filter == 0) // When you reach the end of the filter at the > >> end of a valid word, add the word. > >> { > >> if (root->words) words.add(root->word); > >> } > >> else if (*filter == '.') // Search for words with any letter > >> { > >> for(int i = 'a'; i <= 'z' ; ++i) > >> findWords(root->link[i], filter+1); > >> } > >> else // Search for words with the required letter > >> { > >> findWords(root->link[*filter], filter+1); > >> } > >> } > >> > >> On May 28, 4:47 am, avinesh saini <[email protected]> wrote: > >> > How to search all the matching words for a filter in a trie. > >> > e.g. > >> > searching by filter "...r..m" will find all the words(of length = 7) > in > >> > trie in which 4th character is 'r' and 7th character is 'm'. > >> > > >> > -- > >> > * > >> > * > >> > *thanks & regards,* > >> > *Avinesh > >> > * > >> > >> -- > >> You received this message because you are subscribed to the Google > Groups "Algorithm Geeks" group. > >> To unsubscribe from this group and stop receiving emails from it, send > an email to [email protected]. > >> > >> > > > > > > > > -- > > > > thanks & regards, > > Avinesh > > > > -- > > You received this message because you are subscribed to the Google > Groups "Algorithm Geeks" group. > > To unsubscribe from this group and stop receiving emails from it, send > an email to [email protected]. > > > > > > > > -- > You received this message because you are subscribed to the Google Groups > "Algorithm Geeks" group. > To unsubscribe from this group and stop receiving emails from it, send an > email to [email protected]. > > > -- * * *regards,* *Avinesh Kumar National Institute of Technology, Calicut.* *Kerala- 673601* *+91 7849080702* *http://www.facebook.com/avinesh.saini* -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To unsubscribe from this group and stop receiving emails from it, send an email to [email protected].
