@Prem
I know the implementation of trie...But I have doubt that say I have
struct trie * current..
and input = abc...The last character matched with head-CHILDREN[i]-
letter will be 'c'... now current points to c
next step- there will be 4 branches from
'c'...de,xyz,efgh,pqr...
Now if
@Prem
I know the implementation of trie...But I have doubt that say I have
struct trie * current..
and input = abc...The last character matched with head-CHILDREN[i]-
letter will be 'c'... now current points to c
next step- there will be 4 branches from
'c'...de,xyz,efgh,pqr...
Now if
It is not working..Even i tried to solve the problem using recursion
but it didnt work
code :-
http://ideone.com/UhTTx
--
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
You should do a dfs from the node which matches the prefix say abc. If
its a word then print it.
On Thu, Jun 28, 2012 at 3:55 PM, deepikaanand swinyanand...@gmail.comwrote:
It is not working..Even i tried to solve the problem using recursion
but it didnt work
code :-
