Sir, can we have a notes (Offline) which you kept at your website.Can you post it in a pdf format so that we can refer at any time and during exams, when there is a lack of internet.
I thought I'd finally know how to pronounce Dijkstra but when you approached it and said that even you are confused about it, i laughed my ass off. Somethings just bring us Indian Engineering students together. HAHA
After watching codewithharry(arrays), striver(recursion) and apna college I can say this is the best playlist I have found yet. I learned from him(sorting, tree, heap and graph) thank you @simple snippets
Hello tanmay your all videos are very good and informative. But in this video your complete binary tree concept is little bit wrong. And Heaps follows the rule of almost complete binary not complete binary tree.
heap data structure: tree based tree is complete binary tree max heap and min heap definitions applications of heap data structure heapify - used to create heap data struc insert delete
This is the best playlist for DSA right now. 👍
Thanks Milind! Please do share the videos and channel with your friends too. Thats the biggest help and support you can give back to our channel!
and what will you suggest for web dev which playlist
After 2 to 3 years, your playlist will be the most viewed ones for D's and algo....
Sure😇
Your earlier pronounciation of Dijkstra was hilarious. Thanks a lot for these videos. You make better content than paid courses for free imo
Currently i m in 1 sem...i m quite sure that in my 7 sem also i'll be watching this playlist buddy..great job♥️♥️♥️
Your explanation of heap structures is much clearer than my professor’s lectures. Thank you for these videos!
Thank-you for providing this most valuable tutorial.
You are a gentleman and a scholar.
Just a kind information, you are still helping a lot of us... Do continue the great work. Forever grateful.. Thank You sir.
I am from தமிழ்நாடு nice explain✌️✌️
This is the best DS course ...plz complete this playlist as soon as possible
Thank you so much buddy! Yes will keep on making more videos in this course.!
This video marks me finishing this playlist! Thanks for the awesome content!
Will be eagerly waiting for the future videos!!
peace! lol
Sir I am thankful to you with my inner heart.
Most welcome Salil 👍😊
By how much time, entire series will be uploaded
Data Structures & Algorithms never ends!
Sir, we getting close to the End Sem. Sir, can you please upload the remaining lectures ASAP.
Thank you.🤗
@6:22 The Dijkstra's algorithm is pronounced as "Dy-kstra" or "Deek-stra". Thank for the vide. Very helpful.
Bht bdiya bhai
you are the best.........masum
Sir, can we have a notes (Offline) which you kept at your website.Can you post it in a pdf format so that we can refer at any time and during exams, when there is a lack of internet.
Thank you so much samay❤️❤️❤️
amazing explanation
Well explained lecture
Awesome vedio, thank you!
Relieved, Sir. Thank you so Much!❤️😀
I thought I'd finally know how to pronounce Dijkstra but when you approached it and said that even you are confused about it, i laughed my ass off. Somethings just bring us Indian Engineering students together. HAHA
Hahaha I sarcastically say DJ-shatras 😂
@@SimpleSnippets guess I'll continue your legacy haha
😂😂😂😂🤘🤘🤘
After watching codewithharry(arrays), striver(recursion) and apna college I can say this is the best playlist I have found yet. I learned from him(sorting, tree, heap and graph) thank you @simple snippets
Thank you so much buddy. I'm glad you found my videos helpful. Please do share them with your friends too 👍🫡
@@SimpleSnippets yes sure, I think you should make playlist on competitive coding.
@@gopal1291 yes I have plans on doing that as well 👍😊
@@SimpleSnippets thanks a ton 🙏
Really Good explanation
Waiting for next video of this playlist
Osmm bhaiii waiting for this topic
Plz make video on how to solve coding problems on different platforms like gfg
what are the program you writing in call? great and deep explanation, helps me a lot along with the several resources. Thank you!
Thanks👍
Welcome 👍
Keep it up bro🙏
Aree Sir ye to btao kab aayega next video, Abhi to graph bhi nhi padha. B.tech khatam hone wala hai
superb
Thank you 🤘
I hope you explain hash table , Thank you so Much!❤😀
when will you upload graph topic bro? Btw love your video.
Please upload the next part of heap...I am waiting for tutorial.
Thank You !
Hello tanmay your all videos are very good and informative. But in this video your complete binary tree concept is little bit wrong. And Heaps follows the rule of almost complete binary not complete binary tree.
DJ shaktra is a valid pronunciation. I use "dike-stra", bc thats what my professor calls it
Could you pls tell me When remaining videos will be uploaded
How many video will ne there more to complete this course
Sir please upload video on dynamic programming
please upload video on heap sort
Soon
its been a looooong time, you havenot uploaded further videos..
Sir graph ke videos post karo jaldi, please.
6:17 It's pronounced as 'Dyke- Struh' algorithm.😊
Noted 🤘
Although DJ-kshatras sounds more funny and epic no? 😂
@@SimpleSnippetsIt kind of does😂
Se estan divertiendo
bhai or videos kb aayegi
Bro we need heap sort with example
please cover graph DS it really need me
heap data structure:
tree based
tree is complete binary tree
max heap and min heap definitions
applications of heap data structure
heapify - used to create heap data struc
insert delete
Read Dijkstra as Die kstra
It is pronounced as dis kas tra or you can pronounce it as die kas tra
Dijkstra is Dutch and their "ijs"s sound like "I" so it's pronounced "Dike-stra".
Dayum 🤯 this is valuable information✌️🤘
what rubbish..complete binary tree defination is wrong