Indexed Priority Queue | Data Structure | Source Code

[@pokerface550]

Awesome tutorial! I am especially happy to have learnt about such things as Union&Find, Suffix Array and Fenwick tree that are rarely to never mentioned in many other tutorials.

[@akhilvaid6889]

Im finally here. After 52 videos. The last one. Good work and Good luck!

[@kingdominth4]

Sorry, but you're awesome! Thanks for taking the time to create these informative videos! They really help.

[@ashishpandey698]

The whole tutorial was awesome, Thanks!!

[@JitendraKumar-ti6yd]

William, can you please explain the degree part

[@moonmaster36]

How are the parent and child arrays updated during swaps? Or do they not need to be updated?

[@DublinSeafoodInc]

Satisfactory

[@pipilu3055]

minChild is ill-defined, if the parent node i is less than all its children, then there is no minChild, which is contradictory with the comment. I was confused by the sink function until I found the minChild has a different meaning.

[@quocbao6046]

I have trouble understand the degree?

[@junbug3312]

In explanation vid, we delete the node before sink() but in code, sink() happens before deleting the node. Can you explain?

[@WilliamFiset-videos]

The source code on GitHub is the source of truth, the explanation videos sometimes have typos