http://www.geeksforgeeks.org/trie-insert-and-search/
Can any body tell me what is need of checking pcrawl!=0 int the
return..cant we check only its value0 to check whether its a leaf node
return (0 != pCrawl pCrawl-value);
--
You received this message because you are subscribed to the Google
Can anybody provide me to understand t9 implementation? I dnt need code..I
need how to implement t9 with trie with explanation..thnx in advance
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To unsubscribe from this group and stop receiving
Check codingways.blogspot.com
I posted a t9 implementation
On Mar 14, 2013 12:44 PM, rahul sharma rahul23111...@gmail.com wrote:
Can anybody provide me to understand t9 implementation? I dnt need code..I
need how to implement t9 with trie with explanation..thnx in advance
--
You received
can someone share other implementations of trie ?
since here we have lot of pointers with value as NULL... so wasting some
space
On Fri, Dec 28, 2012 at 2:52 AM, Aditya Raman adityarareloa...@gmail.comwrote:
@Sachin :thanks man i just tried to change the code with focus on
Hello everyone,
I was trying to implement Trie in c++ for the first time and got some
issues in coding its implementation.
The code has 2 commented lines namely cmnt1 and cmnt 2.
I dont understand how does it make a difference if i use cmnt1 instead of
cmnt2 .
Both lines are intended to check if a
executed your code..working fine by commenting cmnt2 and un-commenting cmnt1
--
Hi Aditya,
In C++ member variables gets initialized to garbage values. So in
child function T-Symbol is garbage and is not null so it returns because
of null check. Next in your insert method you try to access that garbage
value. This will cause a crash.
When you remove the cmnt1, you
@Sachin :thanks man i just tried to change the code with focus on
initializing NULL values to child pointers array (TrieNode-symbol in this
case) and it just works fine.
@Atul : thank you for trying to run the code. Actually the IDE i use
preferably is DEV-c++ which had the problem i
yes but i would like to knw for which application you need this ?
On 8/31/12, Carl Barton odysseus.ulys...@gmail.com wrote:
There's no reason why a trie or a tree node couldn't be used to 'represent'
more than one word. Although you'd take a penalty in the complexity for
searching etc.
On 31
@atul: Given a word and a dictionary find all the anagrams of that word in
that dictionary. For efficient access i am storing each word in TRIE with
their sorted key. Ex: BAT will be inserted with key ABT. By this we will
form TRIE of all words.For all the words whose sorted version are same ,
yes this will work
On 9/1/12, Navin Kumar algorithm.i...@gmail.com wrote:
@atul: Given a word and a dictionary find all the anagrams of that word in
that dictionary. For efficient access i am storing each word in TRIE with
their sorted key. Ex: BAT will be inserted with key ABT. By this we
Can we store multiple words in single TRIE node by using linked list or
some other data structure. Based on the some property a node in TRIE will
hold all the word with same property.
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To view
There's no reason why a trie or a tree node couldn't be used to 'represent'
more than one word. Although you'd take a penalty in the complexity for
searching etc.
On 31 August 2012 15:33, Navin Kumar algorithm.i...@gmail.com wrote:
Can we store multiple words in single TRIE node by using linked
Apply DFS in the trie
--
Akshat Sapra
Under Graduation(B.Tech)
IIIT-Allahabad(Amethi Campus)
*--*
sapraaks...@gmail.com
akshatsapr...@gmail.com
rit20009008@ rit20009...@gmail.comiiita.ac.in
--
You received this message because you are subscribed to the
first search for node where abc ends i.e say func Search() will return
node whose
node-ch='c';(last character of input abc)
then pass this node to following algo :-
this is just a code sketchso you can add boundary conditions to
it..(if i miss it)
print(node *root,int j)
{
if(!root)
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
Well it Seems like problem is the DS here.
if U have the DS of trie as
struct trie {
char letter;// Not being general
boolean islast;
int startindex;
struct trie *next;
};
I am sure you
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
do similar to inorder traversal after reaching at node 'c'..you will get
the desired output and in dictionary order .
On Thu, Jun 28, 2012 at 12:23 PM, deepikaanand swinyanand...@gmail.comwrote:
If there is a trie of following strings(say URLs)
abcde,abcegh,abcpqr,abcxyz,xyz
if input = abc
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
20 matches
Mail list logo
