Implement A Binary Heap - An Efficient Implementation of The Priority Queue ADT (Abstract Data Type)

2 minutes into the video, this guy answered questions I had to ask my professors for weeks to understand. You might not understand everything he is saying, but this is the same stuff that I'm being taught at a private, super expensive, well ranked engineering school. Thanks for the help!

"we're missing one child here, that's fine."

this is really good!..cheers

Absolutely love the explanations of the fundamental building blocks of the more complex stuff! Much gratitude.

perfect

Love your enthusiasm in this tutorial!

you are an increadible human being for puttin this content out there.

yeah yeah you got the like

Thanks. Short and sweet review for my exam.

One of the best explanations I've seen for this topic, is complete, clear, with graphics, and examples. Thank you so much.

very detailed explaination

why cant i find the code in the description ?

That's is answer to the question?? Implement?? Where is the code?? Man you just got dislike.

Thank you. That was a nice explanation

You can retrieve the min and max in both a min-heap and max-heap in constant time. They are always the first index and the (heap.size - 1) index of the heap

literally you explain better than any teacher I've ever had, keep it up, greetings from Colombia

I have to applaud you for this! Thank you, thank you! I love how u put it in Layman's term

that's not an IMPLEMENTATION!!! That's an explanation. What a waste of time!!

Great video!

quality videos bro, I not only learn but I enjoy watching them too

You didn't add sectinos to the video. That will help.

Didn't know Lewis Hamilton was a SWE

Thanks for the awesome explanation.

you are an excellent teacher! thankyou!! <3

aah great explanation

So, when you say it takes constant time - O(1) to do peek of the heap, does it mean the caller of the heap does not care about the heap restoration operations. I am assuming the heap restoration operations happens asynchronously in the background. Am I correct on this one?

This dude is a straight boss I love your videos man 👍

I feel like if I had this guy as my professor twenty years ago I might actually be a really good SWE by now lol

When you say an ADT just has a core API, isnt it true that an ADT also has an Asymptotic Complexity contract as well? Nevermind I just googled it. Its just API haha

You should really make complete courses you are so great

Thank you!!!!! You are so good, its hard not to recommend you

amazing brother - nice and simple - keep going, i'll be checking here first!

Thanks! 🧡🧡

The best explanation of heap I could found. Short and clear

Thank you!!!

First video of yours that I've seen. Excited to check out more. Thanks for the info!

I’ve been looking for an instructor like you since i first started studying computer science almost seven years ago

You are so amazing... I think I'm best lucky for choosing this video tutorial among many others....

I'd like to see heapify with o(n) complexity.

Good luck ,you are truly amazing

Man . you are just the best . you are just doing something that a lot of people will appreciate you . your contexts are just perfect . I can't find tutorials about DS&ALG better than this channel .
I just don't understand your pause at the end of Videos :|)

0: Dad am I smaller than you?
15: Yeah
0: I'm your dad now
15: ???

Great work. ❤️❤️

Thank you for the explanation, it’s easy to understand and very helpful!

This is "THE BEST CHANNEL" for SWE..... Love it

Hi, really great video, thanks! I don’t see the code in the description, am I missing something?

bless you dude!

code is not in description