Heaps & Priority Queues - Heapify, Heap Sort, Heapq Library - DSA Course in Python Lecture 9

[@GregHogg]

Master Data Structures & Algorithms For FREE at AlgoMap.io!

[@Brusselsprouts2023]

wow! This channel is so underrated. Thankyou!!

[@steventolerhan5110]

Best video on heaps on youtube fr fr

[@sonhoang8986]

Thank you for your explanation. I love how you explain the theory, but I expected more about the coding section. I hope something from scratch to understand the theory. Anw, thank you so much

[@TaskForce141br]

On the pop is important that you substitute the top element by the rightmost element on the heap, that way you maintain the balance property of the heap, after that you heapify down. The way it was presented may cause confusion, beacause if you just remove the element on the top and do the rearranjement, the heap may become unbalanced

[@kapilrules]

thank you man to negate the values to use it as max heap was awesome trick ❤❤❤

[@GregHogg]

Yeah I found that very cool when I first learned it too

[@Jay-ek7uw]

These videos are great. Much love Greg

[@jingwen888wang]

The pop heap described h err e is incorrect, as it does not maintain the heap property which has the has the leaf nodes filled from left, so it messes up the array structure essentially, please pay attention to the details and correct it if it causes confusions.

[@adventurer2395]

0:15 bro hitting puberty lol. Great video, well explained

[@Emivvvvv]

looool 😂

[@karamalrasam1606]

thank you so much for your clear explaination👍👍

[@ahmedzz4754]

Can't wait to see the dp or backtracking lesson (my national programming contest is soon and I suck a both)

[@phaseyon5825]

how was it

[@Abzal-pd9ri]

Thank you a lot !! Please more videos like that

[@ibraheem_Zain]

that was very helpful and clear thanks man you really great ♡♡

[@GregHogg]

Glad to hear it, thanks so much!

[@leandrormor]

thanks for sharing your view, i appreciate it

[@GregHogg]

You're very welcome!

[@leandrormor]

not your view, but your way of teaching

[@garythegoat8341]

What would happen if that -10 was a leaf node when you were heapifying the min heap? The leaf nodes were ignored but presumably in that case that -10 would need to get to the top?

[@gaberhassan3972]

very nice,👌👌👌👌 Thanks

[@floccinau263]

I feel so bad about watching this great DSA lesson for free so even though I have access to Wi-Fi, I use my mobile data instead. (This won't help you in any way either haha TT) My daily DSA teacher Greg ^_^b

[@WilkinARuiz]

Would heapq. Be ok to use in a coding interview? Wouldn't they want you to implement the code?

[@davenuada527]

What app do you use to draw on?

[@Karandeepsingh-kk2rv]

Could you do a course on linked lists please?

[@asagiai4965]

I'm surprised that idk that heaps and priority queues are same thing. Always thought they are different.

[@GregHogg]

Haha yep!

[@godcomplex8251]

Actually I just looked this up in Sedgewick algo book, it says that heap construction is n.log(n)...

[@DevendraYadav-pw9vp]

you are correct there is mistake just taking the position to correct spot is O(long) and for this to all n will extend the overall complexity to O(nlogn)

[@godcomplex8251]

@GregHogg Love your videos but you should really correct or address mistakes like this, otherwise this can affect your credibility...

[@devshah6634]

23:45 You said the heap is set according to the smallest frequency. So why is (3,4) placed after (4,5) in the heap array? PS: Started watching this course recently, loving it so far!

[@raafayhemani2018]

The heap array is an array representation of a tree, if you wanted to get them in order you'd do a heapsort

[@navneetkumar9377]

Quick question : How are you able to print the trees beautifully at 14:47 ? I can't find any inbuilt function.

[@user-jm6gp2qc8x]

he didn't

[@godcomplex8251]

Hey greg, wouldn't the Heapify function be O(n.log(n)), since for every node in the tree of N nodes, you need to perform "Sift down" which itself is O(log(n))?

[@sitrucz]

No look for a proof. O(n)

[@atanumaiti16]

when u added 13 to the heap, it violates complete binary tree property.i think it should be added as right child of node 7. same goes with -2.

[@sitrucz]

It’s not a binary tree. Order of children don’t matter.

[@dfhg315]

684. Redundant Connection can u make video on this problem

[@asagiai4965]

15:36 I thought heap pop have time complexity of 0(1)? Since you are just popping the minimum or the maximum (depends on what type of heap you have) at the top.

[@GregHogg]

Nope, peek has O(1) but to pop you need to fix the tree which is log n

[@asagiai4965]

@GregHogg ok I see there's a difference.

[@qulinxao]

sorry but in "real" pq only one(or zero) node have 1 child - others ether 0 or 2 - it simplifay :)