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
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
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
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.
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
Your earlier pronounciation of Dijkstra was hilarious. Thanks a lot for these videos. You make better content than paid courses for free imo
After 2 to 3 years, your playlist will be the most viewed ones for D's and algo....
Sure😇
Thank-you for providing this most valuable tutorial.
You are a gentleman and a scholar.
I am from தமிழ்நாடு nice explain✌️✌️
Just a kind information, you are still helping a lot of us... Do continue the great work. Forever grateful.. Thank You sir.
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.!
Sir I am thankful to you with my inner heart.
Most welcome Salil 👍😊
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♥️♥️♥️
This video marks me finishing this playlist! Thanks for the awesome content!
Will be eagerly waiting for the future videos!!
peace! lol
6:17 It's pronounced as 'Dyke- Struh' algorithm.😊
Noted 🤘
Although DJ-kshatras sounds more funny and epic no? 😂
@@SimpleSnippetsIt kind of does😂
Your explanation of heap structures is much clearer than my professor’s lectures. Thank you for these videos!
Bht bdiya bhai
you are the best.........masum
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.
By how much time, entire series will be uploaded
Data Structures & Algorithms never ends!
Thank you so much samay❤️❤️❤️
Awesome vedio, thank you!
Well explained lecture
Really Good explanation
amazing explanation
Relieved, Sir. Thank you so Much!❤️😀
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 🙏
Waiting for next video of this playlist
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
Hahaha I sarcastically say DJ-shatras 😂
@@SimpleSnippets guess I'll continue your legacy haha
😂😂😂😂🤘🤘🤘
Keep it up bro🙏
I hope you explain hash table , Thank you so Much!❤😀
superb
Thank you 🤘
Please upload the next part of heap...I am waiting for tutorial.
Thank You !
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 👍
Osmm bhaiii waiting for this topic
Plz make video on how to solve coding problems on different platforms like gfg
Could you pls tell me When remaining videos will be uploaded
please upload video on heap sort
Soon
DJ shaktra is a valid pronunciation. I use "dike-stra", bc thats what my professor calls it
Sir please upload video on dynamic programming
How many video will ne there more to complete this course
Aree Sir ye to btao kab aayega next video, Abhi to graph bhi nhi padha. B.tech khatam hone wala hai
when will you upload graph topic bro? Btw love your video.
Sir graph ke videos post karo jaldi, please.
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
its been a looooong time, you havenot uploaded further videos..
bhai or videos kb aayegi
please cover graph DS it really need me
Se estan divertiendo
Bro we need heap sort with example
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.
Read Dijkstra as Die kstra
Dijkstra is Dutch and their "ijs"s sound like "I" so it's pronounced "Dike-stra".
Dayum 🤯 this is valuable information✌️🤘
It is pronounced as dis kas tra or you can pronounce it as die kas tra
what rubbish..complete binary tree defination is wrong