tire will always contain the link to all its children.This problem is just printing out the children once the key is fully reached.
ie., search for abc in trie print all the children of c node. Raghavan ________________________________ From: deepikaanand <swinyanand...@gmail.com> To: Algorithm Geeks <algogeeks@googlegroups.com> Sent: Thursday, 28 June 2012 12:23 PM Subject: [algogeeks] trie display If there is a trie of following strings(say URLs) "abcde","abcegh","abcpqr","abcxyz","xyz" if input = abc then output should be = de,egh,pqr,xyz How can I code for this ??? -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. 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 algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
