Introduction to Heap Data Structure + Priority Queue + Heapsort Tutorial

preview_player
Показать описание
In this video, we'll delve into the fundamentals of the heap data structure, explore priority queues, and walk you through a comprehensive heapsort tutorial. Whether you're preparing for a coding interview or just eager to expand your data structure knowledge, this tutorial covers theory, practical coding examples, and an in-depth look at how it all comes together.

👉 Resources

Take part in the learning in public initiative! Share your learnings on LinkedIn and Twitter with #DSAwithKunal & don't forget to tag us!

======================================================================
Timestamps:
0:00:00 Introduction
0:01:58 Why heaps?
0:10:02 How heaps work
0:21:40 Inserting items in a heap
0:28:20 Removing items from a heap
0:35:15 Code
0:50:32 Heapsort
0:55:45 Priority Queue
0:58:03 Creating a heap from an unsorted array
1:09:14 Closing remarks

#heap #placement #dsa #computerscience #faang
Рекомендации по теме
Комментарии
Автор

Take your time kunal to make this videos. People are saying complete it ASAP & all. But I know it takes a lot of time & hard work to make videos. It's not that easy to Record, Edit, Render, Make thumbnail. There are so many things that can go wrong (maybe you forgot to record, rendering issues etc) So, Just to let you know take your time with these videos. Because I know that this videos are the best & it's the only thing that you need to watch to understand DSA.
Being watching your videos since 2months (LinkedList, Search, Trees) It's helping me a lot.
Thank You so much !!

poorpanda
Автор

Everybody who has not understood data structures yet just waits for your videos .. and you make it look so simple .. I'm sure those who watch these will never forget the concepts again in their life.

AtharvaRao
Автор

This series is just I literally have no words to explain how much helpful it is.❤❤❤
A big big thanks for making these videos, Quality content for

gojosatoru
Автор

Finally Dsa with kunal is back.... Hope u complete this series soon

Jyothirmai
Автор

The last concept, in which we are getting the time complexity for creating a heap with an unsorted array was a something new .... looking forward to learn more good concepts and great topics like Graphs and DP from you ! Thank you🙏

ritanshubirla
Автор

lol fang youtubers were criticizing him for not completing his DSA series meanwhile they themselves haven't done anything for the community for free.
Atleast he was trying to do and Now he is back🙌❤

jaymahakaal
Автор

You have helped me a lot with understanding Data Structures and Algorithms. Thank you.

LizyAd
Автор

"Java doesn't have pointers so you get my point" framing this!

sysybaba
Автор

this video deserves q10000+ cmnts why only 172 ?

hats off to you kunal

amazingvideos
Автор

49:06 notice how he is using *if* and not *else if*. If the left is less than min then min will be left but again if the right is less than the min[which is already less than left], then finally min will be right and then it may/maynot be updated. The min pointer also moves faster than i. A cheating technique can be to also run the loop till *log(n)* times

vasachisenjubean
Автор

One thing to note is that since we are shifting and not replacing the elements while swapping, if will be creating duplicate elements in the list. E.g. If the original list is [34, 45, 22], after swapping first and last elements, the list will look like this: 22, 34, 45, 34, 22. So, better to use Collections.swap() instead.

pramithasdhakal
Автор

My Favourite language is c++, and i am doing coding in c++ only but looking to your teaching techniques and skill i used to watch your dsa series
Thank you for such a incredible content 🙏🙏

_sakshijadhav
Автор

Hi sir I'm from Norway, please keep making these videos, I'm having the algorithm course now and I really need your videos!!

HB-nwcb
Автор

no can provide this high quality teaching

sasikanth
Автор

So many people making it complex but You made heaps really simple.

upendrakumar-bwjd
Автор

Here comes the most awaited video of the Supreme DSA Playlist ❤ U r the Best Tutor❤❤

sakshamjoshi
Автор

has someone ever told you that the content you are providing us can't be found in other creators. So, huge thanks for easy explanation of heap ❤

karimovich_
Автор

I would even pay for this course such great way of teaching. And please go ahead with DP

prettylilnerdy
Автор

We're getting close to most complex topics Soon. Thank You Kunal!!!

vikrant
Автор

Take your time kunal to make this videos. People are saying complete it ASAP & all. But I know it takes a lot of time & hard work to make videos. It's not that easy to Record, Edit, Render, Make thumbnail. There are so many things that can go wrong (maybe you forgot to record, rendering issues etc) So, Just to let you know take your time with these videos. Because I know that this videos are the best & it's the only thing that you need to watch to understand DSA.
Being watching your videos since 2months (LinkedList, Search, Trees) It's helping me a lot.

muhasibHafeez