Thank you so much for the easy-to-understand explanation. So much better than my professor's explanation. I think most people like to overcomplicate things just to sound smart, but you made it nice and simple.
Really good video indeed ! If I had one comment, Priority Queue by the name suggests we want something of higher importance right? But we are drawing minimum every time. So then the same logic could be applied to create a max heap for priority queue? What am i missing? Thanks again !
Thank you Mr.Moore, very clear
Thank you so much for the easy-to-understand explanation. So much better than my professor's explanation. I think most people like to overcomplicate things just to sound smart, but you made it nice and simple.
Great video! Thanks Carleton. Really clear.
just awesome man (y) . Short and to the point .
That was a very clear explanation. Thank you.
it's awesome Sir. Thanks a lot!!!
Thank you so much..!
Thank you. Nice and direct explanation!
Great video. Thanks a lot
Thanks from New Zealand!
Very clear and nice explanation.. Thanks a lot1
are you aboard a very large ocean vessel? what is that rattling noise?
very clear , and helpful!!! Thanks !
Awesome
Best explanation! Keep making video sir!
Thanks for your videos, very helpful. :)
Thank you for this explanation it was very helpful
super helpful. thanks.
Its helpful. Thank you sir!!
good man thank you
nice video!
nice video
Really good video indeed ! If I had one comment, Priority Queue by the name suggests we want something of higher importance right? But we are drawing minimum every time. So then the same logic could be applied to create a max heap for priority queue? What am i missing? Thanks again !
Sir, the swap here is a swap of values or the swap of references to the values?? Thanks in advance.
It depends on the programming language you are using. In Java, for Objects you are swapping the references to the values.