C++ Data Structures: Min-Heaps

[@abdelrhmanahmed1378]

actually the indexing start with 1 , and the zero position we put garage to maintain the rules l=2*i r=2*i+1 p=i/2 ,and that all the books definitions

[@govindrathi9340]

Hey Nick. Great content. Although heapify can be made much more efficient. remember leaf nodes don't need to be headpified. so if i>size/2 simply return for heapify method !

[@blackwolfkills]

Obviously....But he wants to keep it as simple as possible. I see you r a brilliant programmer but u don't have to prove that here.

[@christhomas3524]

This was very helpful, thank you

[@CoffeeBeforeArch]

Chris Thomas no problem! Happy to help!

[@nahimkamruzzaman4104]

Hello, this was very helpful to understand binary heaps. I was wondering if you need the capacity. Can you just make a min heap without a capacity and what is the point of having a capacity?

[@sarthakbhatia7888]

clear and to the point.Thanks:)

[@CoffeeBeforeArch]

Happy to help!

[@abhijitpaul7683]

can I know of the name of the blackboard software you are using? I am searching a blackboard like that for awhile. The info would be really helpful to me.

[@CoffeeBeforeArch]

Xournal

[@JesusMartinez-bg9xp]

Great Video! Helped me understand this data structure much better. Keep up the great work!

[@CoffeeBeforeArch]

Thanks! Glad you enjoyed it!

[@Yourcreepyneighbour44]

why is the end working? You don't use the int min again. In my programm after i extrect the min element the heap don't print again

[@blackwolfkills]

Brilliant explanation....love it bro!!!!!....keep on making such videos plzzzzz..

[@ashwinsingh1325]

Hi I loved this content, if you have time could you possibly cover some more algorithms? Such as topsort, bellman-ford, kruskal's, prim's

[@mizokx1310]

amazing video! you helped me a lot with my studies :)

[@nullbrain8552]

Super helpful thank you!

[@CoffeeBeforeArch]

Zacree Carroll happy to help!

[@neloysinha8098]

why does this have so less views ?

[@PriyanshuRaj-oc4tk]

great video man! 🔥👍

[@CoffeeBeforeArch]

Glad you thought so!

[@PriyanshuRaj-oc4tk]

​@@CoffeeBeforeArch i used this implementation to solve this problem: practice.geeksforgeeks.org/problems/kth-smallest-element/0 Here is my code, but when i submit i get Segmentation Fault (SIGSEGV) runtime error. Here is my code: drive.google.com/file/d/1uLXrf81ZxRABxj8y3PcPa4szIdFPjWoI/view?usp=sharing If you could take a look, it would be very helpful, thanks in advance!

[@ialirezaghazavi]

Hi, this video was awesome, it makes lots of help to me. Thank you :)

[@CoffeeBeforeArch]

Happy to help!

[@midrees1286]

awesome :)