Sir plz inform ...is this playlist of data stucture complete? Can i crack campus placement by going through it?? I am currently persuing BE 4th yr... Plz inform sir...
Do we also need to check for D because it is the only remaining node and it's neighbor E was already out. If yes then can we change the value of E which is already out?
Sir,in the graph ,we are visited at "E" but we have only one node that is next node is "D" of cost 15 but "A" to "D" cost is 14 . what will we do next "Tell me Sir,please"
finally I have understood because of you Sir. From books I couldn't at first.
Thanks Sir because of you i fully understand about data structure...
Thank You So Much Sir Too I ve Complete Almost part of Data Structure.coz of you those all videos are very helpful to us thank you sir.
A hearty thank u to u sir.
ur videos r really very useful.
and easy to understand.
Shukrya sir... Mujhe bahut kaam Aaya aap ka vdo...
thanx a lot sir...!
bahut sahi kaam kr rhe ho sir ji...!
m jo bhi sikha hu sb apse sikha hu..!
Sir kindly make a video on A* search as well btw your tutorials are amazing!!
Best teacher 👨🏻🏫 awesome amazing sir.
Sir please upload videos on data structure programs on DFS ,BFS and tree related and others
Hello My Sir Ji
Sir agar given graph me direction given na ho to kese pta lgega ki neighbors kon hai Kisi vertex ke?
Great video sir
Wah sir Jee wah hats off to u😊😙
thanks sir , ure are hero to me
i was really really need this
Thanx Sir
Sirji U look like falguni pathak male version! 😋😂😂😂😂😂😂😂
ha ha ha unique comment
lol hahaha
Ya exactly
to me also haha
Sir plz inform ...is this playlist of data stucture complete?
Can i crack campus placement by going through it??
I am currently persuing BE 4th yr...
Plz inform sir...
Campus placement crack kerliya kya apne didi
I have the same question pls reply sir
Do we also need to check for D because it is the only remaining node and it's neighbor E was already out. If yes then can we change the value of E which is already out?
sir,a very nice vedio.Now I can understand all of the DS very clearly.
Sure
Sir,in the graph ,we are visited at "E" but we have only one node that is next node is "D" of cost 15 but "A" to "D" cost is 14 . what will we do next
"Tell me Sir,please"
Very very nice explanation
sir , dijkstra algo ko hi shortest path in ROUTING bolte hai????
and one more on queues and its types circular queue n priority queue.
Thanks sir!!!
Very nice
Thank you, sir...
sir where is chapter no.38,39 and 49,50, please upload
these also
sir i couldn't find bucket sort. and radix sort.
fibannaci searching and computer graphics tutorial.answer plzzz
sir i couldn't find bucket sort. and radix sort.
fibannaci searching
sir , dijkastra work with negative weight in some problem
Sir d par pochne keliye wese 11 weight ho raha hai par yaha 9 hai??
thanks sir
Thankyou so much for the clear explanation sir
sir what about linked list in this series .and computer graphics tutorial.answer plzzz
sir 27;33sec m sortest cost 1 bi to h so usko q ni lia
Sir please upload tutorial of multistage graph.
if graph is non directed then how can solve it
very helpful video
sir upload more and more video ds
Lengthy bahut hai,vaise achhi hai
Why don't you provide the code ?
Sir ya lecture samaj nahi aa rha hai
Sir part 1 bca year exam q plz
plzz add some more tutorial on linked list
too much confused b/w algo of prim's and dijkstra's
yes!!....i am too cofused...
good rider
sorry 21:17 sec pr