2:34 - Representation of a Binary Tree using Array 14:15 - Heap ( Max & Min ) 16:21 - Insert in Heap (Max) 22:18 - Delete in a Heap (Max) 30:12 - Heapsort 41:37 - Heapify 47:00 - Priority Queues
As someone who has failed data structures twice, I owe this semester's success to you. Not only this, but all of your videos have helped me more than you could ever imagine. Thank you so much; you are a God send for all struggling CS students out there!
Using a syllabus to judge difficulty is like reading the ingredients to a Michelin Star meal and assuming it's easy to prepare since it uses simple ingredients. Preparation and execution are two different things. Switching topics, the class was taught by a professor with the lowest ratings in the school. Resources were seldom provided, ambiguous project/homework requirements, no feedback on work, very unforgiving grader, etc. The way a class is taught is a major factor in determining whether you pass or not. It's good that you're looking into these videos in advance which will provide you with a sort of insurance if you get a professor like I did (twice). @@Abdullah-ak231
Yeah but exactly at that time after deleting 30 array representation was wrong... It should. be 20 16 8 15 10 right ? Do you know at 30:00 how he swapped 8 and 10? Little bit confused
@@gautamvarmak8207 Yes he mistook and did it erong. I didn't even notice this cuz I solved it on my own and didn't even matched with his result. After reading this comment I found that there was some error on his side. No biggie.
Greatest achievement of a teacher is not to teach a student but to make a student curious and interested so that he can pursue on its own. You are one of the greatest teacher i have come across Abdul Sir. If learning from your YT videos can be so much interesting then i wonder how will it be to learn in-person from you.
At 22nd minutes and I paused to come, check the comments because I feel lots of happiness and I was sure many people would be feeling the same. Looking at the comments I was right. This guy is great. Shout out from Kenya
I'm a mostly-self taught developer that started a Computer Science masters and found my foundations lacking. It's been a stressful semester, but your UA-cam materials have been the absolute most effective means for me to remediate my algorithm and data structures deficiencies. I just purchased both of your courses. I hope to be able to work on them over the summer, but even if I don't, I wanted to purchase your content to express my gratitude for the excellent free content you provide here on UA-cam. I'll be suggesting your materials to my friends that are learning to code and trying to self-teach algorithms and data structures. Way too many courses focus on flash and polish on their videos at the expense of content. Your videos are great because they focus on content and give us plenty of examples. 🙇♂️🙇♂️🙇♂️🙌🙌👏👏
40:52 "copy everything from the board or (moves away from the frame) take a snapshot" that's what an awesome teacher is. Always knows what the students need.
31:33 - I am pausing to appreciate the effort! Thank you very much again. The clarity in simplicity is awesome. In my decade of software development engineer career I have found very few as this great explanation of the core computer science topic. Looking forward to complete the playlist.
@@abdul_bari I am from Kathmandu, Nepal. I completed by Bachelor's Degree in Information Management from Tribhuvan University, 2009, Kathmandu, Nepal. And I am near about completing the playlist :) I think the next step or the future videos I would love to see would be on ML and it's related mathematics because this topic is becoming very much popular and I find the usage becoming relevant to many people from various backgrounds. Thank you very much for the great effort in making such wonderful tutorials for people like me who is always looking forward to improve and learn. I look forward to your future videos.
@@jackfrost8969 When ever I learn new languages or re-cap on the ones that I have used before, I do it by learning: data structures and algorithms. Doing this helps to get more insights about the usage of the language and adds more problem solving skills with that language. I am not an expert, just some one who learn new things and revisit to basics always adds depth and as well as different perspective as a software engineer. Thanks.
Abdul Sir, I have been working professional for 10 years now but never have I ever been so comfortable with Heaps. Thank you for making it so easy and clear for us.
2:04 I can tell you exactly what kind of content you will get after purchasing this course. I purchased the java, DS courses e 2 months ago. The courses are fabulous and the concepts are covered in great detail. Not just for exams or interviews but the knowledge provided is also superb Don't think twice before purchasing this course. I got a lifetime validity on this one.
I am halfway finished with the insertion in the max-heap part, and I can't help but type this out. Your explanation is so good that it almost feels like I already know all of this, and I'm just revising. It's incredible! Teachers are truly like gods.
There is a small mistake at 29:41, when deleting 30 from the heap, 8 is swapped to the root. it should compare 16 and 20 to 8, and use 20 as the new root, thus 20 and 8 is swapping place. No further swaps are needed, resulting in heap in state 20, 16, 8, 15, 10.
@@KarthikRamurg Negative on the comparison. The children of 16 is 15 and 10. The children of 8 is NULL and NULL. When comparing children to parent (i) the index is left (2i) and right (2i+1). In the video he compared index 3 with index 5. When actually index 3 can only be compared with either indexes 6 & 7. However, those nodes were deleted and replaced with previous maxes( index 6 of value 30) and (index 7 of value 50). The next deletion of 20 would render the tree to be 16, 15, 8, 10. Where indexes 5, 6, & 7 are holding previous max values of 20, 30, & 50.
Just want to point out how much work goes into making videos like these - first he has learned and mastered the material better than most instructors I have ever met. That takes decades. Then material and examples must be prepared. Video has to be recorded and edited. If a video is one hour, easily it can take 4-5 times longer to make it. Thank you for these incredible videos. You dive in and cover the content in a way that makes it "click"!
I rarely leave a comment on youtube but the quality of your teaching is so good that i had to leave a comment for you. Sir, the way that you explained heapsort and its intuition made me smile. The mark of an exceptional teacher in my eye is one who teaches in a way that makes a concept obvious to a student. Thank you so much sir! this was an incredible lecture
The most amazing explanation of Heap I’ve ever seen. Made a difficult topic feel like a walk in a park. Thank you for posting this level of amazing contents free for all. (Purchased your DS&A course on Udemy now). Thank you.
Abdul Bari sir , mycodeschool , saurabh shukla sir are legends for students of CS :) Will be thankful of u forever. A teacher's knowledge will be with us forever.
Your tutorials have demystified data structures for me. When I was in college taking these courses, it was overwhelming and confusing. But, the way that you break it down makes so much sense and it actually makes it enjoyable!
That apple example was the key for me. After that, I felt like everything was put in place in my brain. I can't forget about Heaps now! Thank you Abdul. Much love from Uruguay.
30:29 what a moment sir you are the bestest in teaching this deep concepts easily ,your flow of teaching concept is just remarkable,thank you sir for creating such a wonderful playlist.
Creating a Heap is inserting all the elements of a given array into an existing heap assuming the first element of the given array as the initial heap, where as Heapify is simply creating a CBT ( complete binary tree) with all the elements of the given array and then converting that CBT into a heap, by moving up from the last non-leaf node up to the root. Great explanation as ever.
51 minutes of pure knowledge and valuable in formation ! We humans take granted of so many things if we get it for free or just like that very few can understand the value of this video . Thank you so much sir for sharing your knowledge and wisdom .
You are a hero sir! To every Compurter Science Students. Every single concept of Heap explained so properly and with great details! No other teachers could have gone to such lengths as you! I really wish you the best of health and best of everything!
This is one of the clearest explanations of heaps I've seen. I really appreciate how you built up the concepts gradually - starting with binary tree representation, then complete binary trees, before diving into heaps. The visual demonstrations alongside the array representations really helped show how heaps work in practice. Your careful walkthrough of insertion, deletion, heapify, and heap sort showed not just how they work but why each step matters. The final connection to priority queues helps show why heaps are so useful in practice. Thank you for creating such a thorough and well-structured lesson!
I was genuinely sitting in my algo class so lost and depressed thinking I am stupid for not understanding heaps, but you explained it so articulately and clearly, I can't believe it's that simple! Amazing work!
Brother Abdul Bari. May Allah bless your soul, you’re the best teacher I have ever seen. I wish I was your actual student in person. Your teaching style is so beautiful mashAllah
You are an incredible teacher, Abdul Sir. You teach every topic in such a simple way. Thank you for making these videos. It is an honor learning from you.
Sir you have made it so simple. I couldn't get the concept with any tutorial, but you made it so easy to understand. I can't express my regards to you. You are a gem. Thank you so much sir.
Abdul Bari sir proved that "Simplicity beats complexity".. I see where he would have struggled during his graduation, hence he is emphasizing there with a little stressing voice in the video to make you note on certain points. Myth resolver!!
In heapify at last he did two iteration. Two is the size of tree here. So if number of elements are n we have to do log(n) iteration (Depends on case). So, going through each node will take n time and heapify will take logn time. Therefore time complexity should be O(nlogn) for heapify. Isnt it????
I really feel the lack of exact words to express my gratitude towards you sir , every second of yr video is worth watching , its like you go inside the students mind , see their level of understanding & then teach it the way students can get the whole concept behind it , thank you so soo much Sir , you're great!!
I recently started watching your videos and I'm really fascinated by the simplicity and clarity by which you teach. That shows the command you have on the subject. Thank you so much!
Abdul Sir is alone a university for me . I have cracked 2 interviews on the basis of DS , and all its credit goes to sir. Heartly thankyou sir for god level videos/explainations.
He is giving the toughest concepts just like doing everyday conversation with a friend. My GOD! I am scoring an A tomorrow and I dedicate that to you. May Allah gives you all the success and fame which is inevitable for you! :)
I saw this video the night before an interview. Learnt what a was heap for the first time. I am lucky so I got heap question and I implemented for the first time in the interview. I owe this man the internship I got
Okay, haha, my favorite part HAS to be 43:40 to 43:44! Wonderful video overall~ But I think that the part between 29:50 - 29:56 is not correct. 10 (in 5th position) is not the child of 8 (at 3rd position) [(3*2 = 6, but that's outside the heap; so 8 actually is a leaf, on the right side of 20)]. (Also at this point, he hasn't yet fixed the 10 on the 2nd position which should really be 16; a minor slip)
Completely flabbergasted after watching this lecture; unbelievable explanation of the concept of HEAP. The world needs more teacher like Mr. Abdul Bari who can make ambiguous topics so easy to understand. Looking forward to take more of your courses.
I was gonna buy your course today, but it’s at $99. I will have to save a bit first, but I know it will be worth it because you’re the only person that can make me understand this stuff.
Sir..We the Bangladeshi student's are very much grateful to you.Even teachers from our universitie's suggest your algo videos .But one thing to mention!! Please don't stop making videos on algorithms and data structures.Please include more and more advance algorithm in your playlist.I discovered myself and my friends viewing your videos even before the very last moment of exams.May Allah bless you..
I might be wrong on this, but at 29:38 if 30 is deleted that should not be the array that we end up with. It should be {20,16,8,15,10}. In the explanation you gave here you told 10 is a child of 8 but that's not true 5/2's floor value is 2 thus it's parent is 16.
Let’s appreciate the way as he taught Us DSA , in my clg i also watched his videos only, thank you so much sir for providing these easy way of explanation.❤🙏🏻
You are an amazing teacher! Every time I watch one of your videos, I get mind blown by how everything makes sense. Thanks so much, you are the reason I understand Algorithms
Wow Mr. Bari... Your first series about complexity were great, but here you clearly supercharged yourself, very very good content. Natural talent, thank you for sharing your knowledge and amount of time and effort you put in these Algorithm series.
Brilliant lesson just in time! Now i can bravely do a lab on Algorithms and Data Structures about heaps and it not the first time your channel helps me in studies! Thank you a lot!
Throughout my 1st sem of B.tech upto now(5th sem)...I already had a fear of the Sorting algorithms...but now...all of them looks so easy sir..Thanku so so sooo much sir...u made these topics so easy!!! Like seriously..I was literally so depressed that how will I cover this...coz I was unable to find any proper resource...and..I finally got ur lectures sir...Thanku again sir!
Sir I purchased your course on Udemy with discounted price and soon I will start taking course lectures after finishing your UA-cam playlist. Ma Sha Allah I started feeling confident in Algos after that. Jazak Allah Keep it up Sir. You are doing great work 👏 🙌 👍
Started my masters in computer science this semester and it has been pretty stressful as I lack the fundamental knowledge of my classmates who did their bachelors in CS. This channel has literally saved me for the Algorithms final exam. Thank you Mr. Bari for all your hard work, your method of teaching is incredibly effective. I will definitely recommend this channel to other classmates in need.
the moment he explained that insertion and deletion ,,,its like logic came and wacked sense of why priority queue takes O(nlogn)time and all other sheap cocept became crystal clear......kudos sir...thanks for tht slap
Tomorrow is my exam and i m learning it from my favourite teacher and the fun part is that my class teacher has also seen your videos to teach us. He has taken the same examples u taught here of all topics😂😂
Mr. Abdul, i just want to appreciate your teachings. Thanks to you I passed data structures subject (I've never liked it). Keep up the good work! Greeting from Poland! ;)
2:34 - Representation of a Binary Tree using Array
14:15 - Heap ( Max & Min )
16:21 - Insert in Heap (Max)
22:18 - Delete in a Heap (Max)
30:12 - Heapsort
41:37 - Heapify
47:00 - Priority Queues
👍
Nice
You are doing a real good deed man
Thanks man
not all heroes wear capes
So basically we're all going to university to get our degree but we learn all the stuff from youtube tutorials.
Duuuude . This is like the harsh truth. I would have given up long ago without these Online Teachers.
So truuuu......!!!
Prince Desperado so true 😂
Prince Desperado yeah
Very true sadly!
As someone who has failed data structures twice, I owe this semester's success to you. Not only this, but all of your videos have helped me more than you could ever imagine. Thank you so much; you are a God send for all struggling CS students out there!
3 year old video and he still likes the comments. Absolute mad lad :D
ua-cam.com/video/9mXD82-CUEs/v-deo.html
@@gytiskau1865 ua-cam.com/video/9mXD82-CUEs/v-deo.html
Using a syllabus to judge difficulty is like reading the ingredients to a Michelin Star meal and assuming it's easy to prepare since it uses simple ingredients. Preparation and execution are two different things.
Switching topics, the class was taught by a professor with the lowest ratings in the school. Resources were seldom provided, ambiguous project/homework requirements, no feedback on work, very unforgiving grader, etc. The way a class is taught is a major factor in determining whether you pass or not.
It's good that you're looking into these videos in advance which will provide you with a sort of insurance if you get a professor like I did (twice).
@@Abdullah-ak231
@@Abdullah-ak231damn bro you're so smart but who asked?
30:30 That jaw dropping moment!! Never thought that heap sort could be explained so elegantly. Great work sir!
Exactly my thoughts
Yeah but exactly at that time after deleting 30 array representation was wrong... It should. be 20 16 8 15 10 right ? Do you know at 30:00 how he swapped 8 and 10? Little bit confused
@@belalr2198 Ur right, 8 and 10 should not be swapped. He mistook 10 as the child of 8 and swapped them.
@@gautamvarmak8207 Yes he mistook and did it erong. I didn't even notice this cuz I solved it on my own and didn't even matched with his result. After reading this comment I found that there was some error on his side. No biggie.
I was like "DAMN I DIDN'T EXPECT THAT COMING"
Greatest achievement of a teacher is not to teach a student but to make a student curious and interested so that he can pursue on its own. You are one of the greatest teacher i have come across Abdul Sir. If learning from your YT videos can be so much interesting then i wonder how will it be to learn in-person from you.
Wow, thank you
ua-cam.com/video/9mXD82-CUEs/v-deo.html
At 22nd minutes and I paused to come, check the comments because I feel lots of happiness and I was sure many people would be feeling the same. Looking at the comments I was right. This guy is great. Shout out from Kenya
i've done the same lol
Bro you feel me!
i did the same at 30 minute mark!
He is the best teacher !!
For me it was 31st minute :)
I'm a mostly-self taught developer that started a Computer Science masters and found my foundations lacking. It's been a stressful semester, but your UA-cam materials have been the absolute most effective means for me to remediate my algorithm and data structures deficiencies. I just purchased both of your courses. I hope to be able to work on them over the summer, but even if I don't, I wanted to purchase your content to express my gratitude for the excellent free content you provide here on UA-cam. I'll be suggesting your materials to my friends that are learning to code and trying to self-teach algorithms and data structures. Way too many courses focus on flash and polish on their videos at the expense of content. Your videos are great because they focus on content and give us plenty of examples. 🙇♂️🙇♂️🙇♂️🙌🙌👏👏
I have taken his classroom course. Everyone in the class was a fan of Abdul Sir. We have so much respect for him.
Sir I'm a beginner in c programming can u provide a list of basic programs??
@@naveenchowdary7959 thanks sir
@Mahendra Singh Udemy Abdul Bari
@Mahendra Singh you will find links in description
Pausing at 30:42 and taking a time to appreciate the simplicity of this video. It is an absolute gem and the way he taught Heap-sort was brilliant.
yea I paused too
@@ninjaa9087 That is exactly what I am doing, the transition to heap sort was so smooth!
You got me 😳😳
Same!!
It was just a chef's kiss right there
What a beautiful and smooth transition from deletion of an element from heap to sorting the heap.
40:52 "copy everything from the board or (moves away from the frame) take a snapshot" that's what an awesome teacher is. Always knows what the students need.
30:50 best part.. how he subtly moved into the concept of heap sort leaving no doubt in mind. Excellent teaching.
couldn't agree more with this!
Same♥️♥️♥️♥️
ua-cam.com/video/UgFNam-Ghpk/v-deo.html
31:33 - I am pausing to appreciate the effort!
Thank you very much again. The clarity in simplicity is awesome. In my decade of software development engineer career I have found very few as this great explanation of the core computer science topic. Looking forward to complete the playlist.
@@abdul_bari I am from Kathmandu, Nepal. I completed by Bachelor's Degree in Information Management from Tribhuvan University, 2009, Kathmandu, Nepal.
And I am near about completing the playlist :)
I think the next step or the future videos I would love to see would be on ML and it's related mathematics because this topic is becoming very much popular and I find the usage becoming relevant to many people from various backgrounds.
Thank you very much for the great effort in making such wonderful tutorials for people like me who is always looking forward to improve and learn.
I look forward to your future videos.
@@AnitShrestha so after a decade what made you revisit?
@@jackfrost8969 When ever I learn new languages or re-cap on the ones that I have used before, I do it by learning: data structures and algorithms. Doing this helps to get more insights about the usage of the language and adds more problem solving skills with that language. I am not an expert, just some one who learn new things and revisit to basics always adds depth and as well as different perspective as a software engineer. Thanks.
I've been a CS teacher, and I applaud your use of multiple diagrams to show the step-by-step results. Well done!
Thank you for all the efforts! you guys are an unsung heroes!
Abdul Sir, I have been working professional for 10 years now but never have I ever been so comfortable with Heaps. Thank you for making it so easy and clear for us.
2:04
I can tell you exactly what kind of content you will get after purchasing this course. I purchased the java, DS courses e 2 months ago. The courses are fabulous and the concepts are covered in great detail. Not just for exams or interviews but the knowledge provided is also superb
Don't think twice before purchasing this course. I got a lifetime validity on this one.
Missing u alot ... you're the person who taught Algorithms in a very soft way .... great man... stay blessed 🤲 Allah bless u ...
what do you mean by missing him ? is he fine ?
Why u say that missing him ? He is fine ??
Why are you telling so ??..is he fine???
@@rajopriyochanda8316 Yes, he is fine! ALHUMDULILLAAH
#Respect.. 50 mins went so interesting like a movie :)
U saved me sir from failing in this subject. Thanks a lot sir..
I am halfway finished with the insertion in the max-heap part, and I can't help but type this out. Your explanation is so good that it almost feels like I already know all of this, and I'm just revising. It's incredible! Teachers are truly like gods.
There is a small mistake at 29:41, when deleting 30 from the heap, 8 is swapped to the root. it should compare 16 and 20 to 8, and use 20 as the new root, thus 20 and 8 is swapping place. No further swaps are needed, resulting in heap in state 20, 16, 8, 15, 10.
Yes, that seems to be true.
yeah good spot
Anyhow, don't we need to compare 8 and its child 10? which is ultimately 20,16,10,15,8
yes
@@KarthikRamurg Negative on the comparison. The children of 16 is 15 and 10. The children of 8 is NULL and NULL. When comparing children to parent (i) the index is left (2i) and right (2i+1). In the video he compared index 3 with index 5. When actually index 3 can only be compared with either indexes 6 & 7. However, those nodes were deleted and replaced with previous maxes( index 6 of value 30) and (index 7 of value 50). The next deletion of 20 would render the tree to be 16, 15, 8, 10. Where indexes 5, 6, & 7 are holding previous max values of 20, 30, & 50.
Just want to point out how much work goes into making videos like these - first he has learned and mastered the material better than most instructors I have ever met. That takes decades.
Then material and examples must be prepared. Video has to be recorded and edited. If a video is one hour, easily it can take 4-5 times longer to make it. Thank you for these incredible videos. You dive in and cover the content in a way that makes it "click"!
The apple pilling in the grocery store with the heap lectures where the best example given so far, smart!
Awesome explanations sir, I never felt confused at any single point in time in this complete lecture. Thanks a lot.
This is amazing. You have such a calm and slow way of teaching and it makes me very relaxed, but also knowledgeable. Thank you!
I rarely leave a comment on youtube but the quality of your teaching is so good that i had to leave a comment for you. Sir, the way that you explained heapsort and its intuition made me smile. The mark of an exceptional teacher in my eye is one who teaches in a way that makes a concept obvious to a student. Thank you so much sir! this was an incredible lecture
The most amazing explanation of Heap I’ve ever seen. Made a difficult topic feel like a walk in a park.
Thank you for posting this level of amazing contents free for all.
(Purchased your DS&A course on Udemy now).
Thank you.
ua-cam.com/video/UgFNam-Ghpk/v-deo.html
Abdul Bari sir , mycodeschool , saurabh shukla sir are legends for students of CS :)
Will be thankful of u forever. A teacher's knowledge will be with us forever.
chilla chilla ke sab ko sceme bata de...
@@ANAS-ex3ru nahi bhai koi is scheeme me nahi jaega unko ytber wale bhaiya ki journey dekhne me jyada interest hai naa ki actual coding krne se.
👍🏼
One hour long lectures are very monotonous and hard to follow but this was not. Excellent content sir :)
This is an excellent explanation of Heap mechanics and heap sort!
ua-cam.com/video/9mXD82-CUEs/v-deo.html
Your tutorials have demystified data structures for me. When I was in college taking these courses, it was overwhelming and confusing. But, the way that you break it down makes so much sense and it actually makes it enjoyable!
That apple example was the key for me. After that, I felt like everything was put in place in my brain. I can't forget about Heaps now! Thank you Abdul. Much love from Uruguay.
30:29 what a moment sir you are the bestest in teaching this deep concepts easily ,your flow of teaching concept is just remarkable,thank you sir for creating such a wonderful playlist.
Creating a Heap is inserting all the elements of a given array into an existing heap assuming the first element of the given array as the initial heap, where as Heapify is simply creating a CBT ( complete binary tree) with all the elements of the given array and then converting that CBT into a heap, by moving up from the last non-leaf node up to the root. Great explanation as ever.
51 minutes of pure knowledge and valuable in formation ! We humans take granted of so many things if we get it for free or just like that very few can understand the value of this video . Thank you so much sir for sharing your knowledge and wisdom .
Thanks! Greeting from a Chinese student.
You are a hero sir! To every Compurter Science Students. Every single concept of Heap explained so properly and with great details! No other teachers could have gone to such lengths as you! I really wish you the best of health and best of everything!
The 50 people who disliked are University teachers who are probably jealous 🤣🤠
Because their not getting paid
Arafat Khan lol yes
Which University?
😂😂😂😂👍
@@jaigupta285 whats app university ...and my proffesor is literally from there so i came here
Best teacher ever! I can't imagine how I struggled to understand heaps, but after landing here..man! I must say I grasped everything.
Such a talented and understandable teacher..To the point and and actually have such a great teaching technique..Million times of respect for you sir
This is one of the clearest explanations of heaps I've seen. I really appreciate how you built up the concepts gradually - starting with binary tree representation, then complete binary trees, before diving into heaps. The visual demonstrations alongside the array representations really helped show how heaps work in practice. Your careful walkthrough of insertion, deletion, heapify, and heap sort showed not just how they work but why each step matters. The final connection to priority queues helps show why heaps are so useful in practice. Thank you for creating such a thorough and well-structured lesson!
Sir, ur video just got an Ad from Game of Thrones and watched it full. My exam is tomorrow and u r the savior.
I was genuinely sitting in my algo class so lost and depressed thinking I am stupid for not understanding heaps, but you explained it so articulately and clearly, I can't believe it's that simple! Amazing work!
Wow, what a way to explain. Definately mi favorite algorithms teacher. Greets from México
Hey Abdul - you are an amazing teacher, Thank you !
Brother Abdul Bari. May Allah bless your soul, you’re the best teacher I have ever seen. I wish I was your actual student in person. Your teaching style is so beautiful mashAllah
This man just looks like he loves imparting KNOWLEDGE!
You are an incredible teacher, Abdul Sir. You teach every topic in such a simple way. Thank you for making these videos. It is an honor learning from you.
Yay! Heaps are my favorite. 😁 I am glad you are back on UA-cam again sir!
Sir you have made it so simple. I couldn't get the concept with any tutorial, but you made it so easy to understand. I can't express my regards to you. You are a gem. Thank you so much sir.
Abdul Bari sir proved that "Simplicity beats complexity"..
I see where he would have struggled during his graduation, hence he is emphasizing there with a little stressing voice in the video to make you note on certain points. Myth resolver!!
In heapify at last he did two iteration. Two is the size of tree here. So if number of elements are n we have to do log(n) iteration (Depends on case). So, going through each node will take n time and heapify will take logn time. Therefore time complexity should be O(nlogn) for heapify. Isnt it????
I really feel the lack of exact words to express my gratitude towards you sir , every second of yr video is worth watching , its like you go inside the students mind , see their level of understanding & then teach it the way students can get the whole concept behind it , thank you so soo much Sir , you're great!!
Mann, you are the best teacher I have ever come across. Kudos..!
You have a natural talent when it comes to teaching!! Awesome explanation, one go through your video and one can never forget the concept. Thank you
Clear explanation, watching it after 5 years still I cant find any other video with such clear explanation.
I recently started watching your videos and I'm really fascinated by the simplicity and clarity by which you teach. That shows the command you have on the subject. Thank you so much!
Abdul Sir is alone a university for me . I have cracked 2 interviews on the basis of DS , and all its credit goes to sir. Heartly thankyou sir for god level videos/explainations.
Congrats !! Adwani
He is giving the toughest concepts just like doing everyday conversation with a friend. My GOD! I am scoring an A tomorrow and I dedicate that to you. May Allah gives you all the success and fame which is inevitable for you! :)
Bless you, I got through my Data Structures class because of your amazing tutorials!
such a great explanation... nothing beats experience.. no animation or anything beats a traditional teaching style by an experienced personnel
I saw this video the night before an interview. Learnt what a was heap for the first time. I am lucky so I got heap question and I implemented for the first time in the interview. I owe this man the internship I got
I clapped my hands at the end of this video. Beautifully explained with great details. Hats off to you Sir.
ua-cam.com/video/UgFNam-Ghpk/v-deo.html
Okay, haha, my favorite part HAS to be 43:40 to 43:44! Wonderful video overall~
But I think that the part between 29:50 - 29:56 is not correct. 10 (in 5th position) is not the child of 8 (at 3rd position) [(3*2 = 6, but that's outside the heap; so 8 actually is a leaf, on the right side of 20)].
(Also at this point, he hasn't yet fixed the 10 on the 2nd position which should really be 16; a minor slip)
Yes , I also noticed that !!
Yes, u r right. I searched the comments that any other also noticed or not. 😊 Thanks
thank god i found someone who noticed..i first thought i was wrong
@@nitishchoudhary201 sahi mai chaudhary bhai dimag khrab hogya tha....mujhe lga kuchh concept rehgya...fir se dekhni pdegi video....
What a crystal clear explanations Sir !!! Words are less to justice your teaching talent . God Bless you sir .
Completely flabbergasted after watching this lecture; unbelievable explanation of the concept of HEAP. The world needs more teacher like Mr. Abdul Bari who can make ambiguous topics so easy to understand. Looking forward to take more of your courses.
Thank you, sir. I am from China, and have trouble in English. With subtitles, this is the first time that I feel algorithm is so easy to understand
You are amazing! You teach so clearly and make me see the gaps in my knowledge. Thank you, Professor Bari!
You're an incredible professor with a lot of knowledge. It is a pleasure to take lectures from you.
Sir if I ever meet you personally, I would give you a standing ovation
Never thought that I will be able to understand Heap sort this easily . I literally smiled when he said that this is only heap sort .
You are the best instructor ever, I wish I found this channel 5 years ago when I was a student.
You have explained it so well sir...The way you taught was really great and it is easy to understand as well....Thank you so much sir.
I was gonna buy your course today, but it’s at $99. I will have to save a bit first, but I know it will be worth it because you’re the only person that can make me understand this stuff.
i have never felt more happy about learning than watching this video
why?
Mr.Abdul is the best teacher I have ever met!
tyvm
LOVED IT. SO CRISP AND CLEAR. LOVED THE ENERGY, THE SPEED AND CONCISENESS!!!!!!
Sir..We the Bangladeshi student's are very much grateful to you.Even teachers from our universitie's suggest your algo videos .But one thing to mention!! Please don't stop making videos on algorithms and data structures.Please include more and more advance algorithm in your playlist.I discovered myself and my friends viewing your videos even before the very last moment of exams.May Allah bless you..
24:40 Mind blowing. I always wondered why the last node is placed at the top after deletion.. now I got the answer.
i would have cleared my algorithms paper with A+ if i found you in 2002.
I appreciate ur desire for learning even after so long ....!!!
bro job karte karte kyu dekh raha hai, i thought concepts of dsa arent used when you join as a developer
@@jay-rathod-01 did he tell you that he got a job?
I might be wrong on this, but at 29:38 if 30 is deleted that should not be the array that we end up with. It should be {20,16,8,15,10}.
In the explanation you gave here you told 10 is a child of 8 but that's not true 5/2's floor value is 2 thus it's parent is 16.
I can literally watch your vdos for a day straight and pass my entire sem
Let’s appreciate the way as he taught Us DSA , in my clg i also watched his videos only, thank you so much sir for providing these easy way of explanation.❤🙏🏻
ua-cam.com/video/9mXD82-CUEs/v-deo.html
Sir...You are "One And Only".. You're Great Sir!!!!☺
Thank you so much. Such a good explanation. I think you are helping a lot of CS studens in this world keep up the good work. Greetings from germany
ua-cam.com/video/9mXD82-CUEs/v-deo.html
You are an amazing teacher! Every time I watch one of your videos, I get mind blown by how everything makes sense. Thanks so much, you are the reason I understand Algorithms
Wow Mr. Bari...
Your first series about complexity were great, but here you clearly supercharged yourself, very very good content.
Natural talent, thank you for sharing your knowledge and amount of time and effort you put in these Algorithm series.
29:54 there you did a small mistake ig plz check again 8 will not be further swapped by 10. 10 is not its child.
Brilliant lesson just in time! Now i can bravely do a lab on Algorithms and Data Structures about heaps and it not the first time your channel helps me in studies! Thank you a lot!
Throughout my 1st sem of B.tech upto now(5th sem)...I already had a fear of the Sorting algorithms...but now...all of them looks so easy sir..Thanku so so sooo much sir...u made these topics so easy!!! Like seriously..I was literally so depressed that how will I cover this...coz I was unable to find any proper resource...and..I finally got ur lectures sir...Thanku again sir!
Do you want to be software enginner at Google?
@@leetcoder1159 yes
@@leetcoder1159 yes...but what does this pair up means?
@@neha_coding5563 I mean helping each other in problem solving
@@leetcoder1159 sure
This video is the golden ground-truth on everything you need to know about Heaps in such simple but detailed manner!
I really like your videos, because there is no bullshit, small talk, or trying to be funny. Just professionalism and clear explanations.
Sir I purchased your course on Udemy with discounted price and soon I will start taking course lectures after finishing your UA-cam playlist. Ma Sha Allah I started feeling confident in Algos after that. Jazak Allah
Keep it up Sir. You are doing great work 👏 🙌 👍
I wonder how will it feel to touch life of so many students with such impacting work .
Started my masters in computer science this semester and it has been pretty stressful as I lack the fundamental knowledge of my classmates who did their bachelors in CS. This channel has literally saved me for the Algorithms final exam. Thank you Mr. Bari for all your hard work, your method of teaching is incredibly effective. I will definitely recommend this channel to other classmates in need.
the moment he explained that insertion and deletion ,,,its like logic came and wacked sense of why priority queue takes O(nlogn)time and all other sheap cocept became crystal clear......kudos sir...thanks for tht slap
This is by far the BEST Tutorial on Heap Sort. Thank you for this. Much love from South Africa
Tomorrow is my exam and i m learning it from my favourite teacher and the fun part is that my class teacher has also seen your videos to teach us. He has taken the same examples u taught here of all topics😂😂
The college seems fraud to me
@@nishant1877 😂😂😂😂😂
Huh , I just took this today in class , it's a good review, thanks mate , and welcome back
Amazing! Especially when heap sort comes from delete a node, I just want to say, oh my god!!!!!!
Mr. Abdul, i just want to appreciate your teachings. Thanks to you I passed data structures subject (I've never liked it). Keep up the good work! Greeting from Poland! ;)
ua-cam.com/video/9mXD82-CUEs/v-deo.html
You are an amazing teacher I have ever seen in my academic journey. I feel like I am sitting for 5 minutes for your 51 minutes lecture