Sir you don't know how awesome you are... I was so so afraid of DS... and now am so confident... On it... And even my sems went so well because of you I was dumb and zero starting from internals to viva but blast the sems... Thank you so much sir... Even a thanks couldn't express my respect for you... And your efforts is out of my words... Thank you again sir🥺
Thank you very much for this wonderful series. I appreciate your effort. I have watched all of your videos. They all were very informative and I have learnt so much from them. Thanks once again.
Sir this was so easy to us because of ur explanation such a wonderful video by u but I have a doubt that is u don't tell the purpose of bfs and why we have to use it? Can u kindly tell me sir
Sir you said elements are removed from front end at 11:07 but at 11:21 you said in reverse....So may I know from which ends do the insertion and deletion take place?
Ur classes of data structure are such a wonderful... first tim i m writing computer exam very well because of hearing ur class.... thankful to u...
Sir you don't know how awesome you are... I was so so afraid of DS... and now am so confident... On it... And even my sems went so well because of you I was dumb and zero starting from internals to viva but blast the sems... Thank you so much sir... Even a thanks couldn't express my respect for you... And your efforts is out of my words... Thank you again sir🥺
I fell in love with ur teaching sir❤️❤️❤️
Excellent Lectures by Sir....Good....Proud Enough ....
u r videos are very easy to understand sir nice explanation and easy way to understanding thank you sir
Excellent Sir miru chala easy ga chapathnaru..because it is Toughtest topic sir... Excellent sir
Thank u so much.......... Sir , your tutorial is one of the best and understandable .
Thank you very much for this wonderful series. I appreciate your effort. I have watched all of your videos. They all were very informative and I have learnt so much from them.
Thanks once again.
The way you are teaching us is too good sirr..thank you soo much for giving this wonderful explanation
Remarkable class for good learning in my eye sight.
Thank you so much for your information and making us very easy to write ✍️
11:17 - 11.25 (Correction )insertions will be done from rear end and deletion from front end...
r u sure
Sir plz also upload the videos of B-Tree, B+-Tree, Heap tree and other types of trees in youtube.
Sir make videos on minimum spanning tree
Thank u sir .Ur explanation are awesome keep it up.
Thank you sir and u r Explaination was awesome
Thank uhhhhh so much sir.... amazing video everything cleared👍
Sir your video is very well and tqsm sir and plz explain the program about BFS and DFS
thank you sir
all classes succcessfully completed
Nice explanation sir, I understand well
Great tutorial man
thanks for your support teacher
Nice teaching sir... Please include some advanced topics like red black tree...
Understood very clearly sir
maza aagaya mashallah
Now I'm fully completed data structure playlist
THANK YOU SO MUCH SIR💜
Sir please make a video on bfs and dfs program explanation
We want Dijkstra algorithm concept video sir please sir
Neat and clean explanation
Informative content
all clear,1.25x Is recommended
Sir this was so easy to us because of ur explanation such a wonderful video by u but I have a doubt that is u don't tell the purpose of bfs and why we have to use it? Can u kindly tell me sir
you are best sir
Sir please do videos on Advanced Data Structures.. please sir... in detail sir
Thank you sir keep doing 👍💯🙏
We can take any example? In my book having different method
Just awesome sir
Sir how can we draw the spanning tree for those graphs
Sir please make videos on remaining concepts
We need more examples 🙂
In bfs all the nodes are check is important ?? What is the use of bfs ?? And explain the closed structure of graph in bfs please sir
super sir.clean explanation
Sir using list graph represtnation mistak
Sir pls make video on minimum spanning tree sir 😊
Sir plz make video on minimum spanning tree
Sir the example you have taken is tree right sir,or else we can use it for graphs also sir
Thank you sir :)
Thank you sir😍
Thanks for ur support
Thanks sir
Thank you so much every thing clear
Sir Make an video about file organization
Sir you said elements are removed from front end at 11:07 but at 11:21 you said in reverse....So may I know from which ends do the insertion and deletion take place?
Insertion takes place in rear (backside)
Deletion takes place in front
sir u should have taken the example of a connected graph than a tree
Sir what's the difference between dfs and bfs
Bro Why applet is not intialaization problem comes sometimes in advancejava?
sir please upload the videos of hashing
sir dfs m poping up s hoti h????? or bfs m front end s deletion hoti h to dono k outputs different askte h na????
One day before exam watching video in 2× speed..
Sir plz make a vedio in searching and sorting sir
Sir , in BFS
BACKTRACKING IS NOT POSSIBLE RIGHT??
Best First Search is (Breadth first search) please tell me sir
Please provide notes for the theoretical question for subject data structures
How will be the questions asked on this topic in entrace exams..sir
There is some correction in your sentence at video 11.25 to 11.37 duration....please check it once....
Exam ki 15 minits unnai meru cheppinattee rastaa Sir.
Can you please upload more videos sir
Sir I think that back traversal is not possible for bfs am I correct or not sir
sir please do videos on hashing please sir
Any one from Lbrce😂😂😂
Some more example give sir
Thank you sir :)