Digital Dictionary

#21

hanji bhaiya , smjh rha hu abhi

#22

bhaiya smjh ni ara . . .

#23

ss

ok use choro abhi , ise dekho .

agar hame ise traverse karna ho to hum kaise karenge…
given hai ki hame node ka data pata hai aur us node ke saare children pata hai (ek vector me).

har node pe aisa kuch diya hai tumko->

node{
int data ;

vector<node * > children

}
1 Like
#24

har ek node pe aayenge ,
us node ka data print krayenge ,
fir vector mai se us node ke ek ek karke children ko uthayenge
fir har ek children ko utha ke uski value pe call krdenge

#25

function ke form me likh ke batao , maano ki tumhe root pointer diya hai

1 Like
#26

void print(node* root)

{

if(root==NULL)

{

    return;

}

node* temp=root;

cout<<temp->data;

for(auto it=temp.children.begin();it!=temp.children.end();it++)

{

    print(*it);

}

}

#27

bhaiya esa kuch??? . . . . . .

#28
#29

ha almost sahi hai bus thodi galti thi deko aur batao kuch confusion ho to ->

1 Like
#30

-> agar ye na use karey to , (*temp). use kr skte?

#31

ha … . . . . . . . . . . . . .

1 Like
#32

yaha tk thik hai bhaiya

#33

abhi yahi me mai kahu ki trie ko traverse karna hai to kaise karoge. . . . . . .
tumhe root node diya hai

1 Like
#34

to bhaiya ese karr skte hai ,
jese abhi aapne vector dia ,
usme hmare paas hashmap hoga…
to maanlo mai temp p khada hu ,
to har ek temp p aake jese isme vector traverse kia vese usme hashmap traverse karenge shayad?

#35

shayad nahi , aisa hi karenge . … . . . . . .

1 Like
#36

lekin pta ni implementation m confuse hora mai , trie ke case m

#37 
class node
{
	char data;
	unordered_map<char,node*> children;
	bool terminal;

};

is baar iske liye function likh ke batao tumhe root pointer given hai
1 Like
#38


dekhna bhaiya , esa kuch?

#39

check karo ->

almost sahi tha.

1 Like
#40

bhaiya jab terminal mil jaayega tb firse str ko khaali bhi to karna hoga or i ko 0 karna hoga