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.
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.
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.
Im finally here. After 52 videos. The last one. Good work and Good luck!
Sorry, but you're awesome! Thanks for taking the time to create these informative videos! They really help.
The whole tutorial was awesome, Thanks!!
William, can you please explain the degree part
How are the parent and child arrays updated during swaps? Or do they not need to be updated?
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.
Satisfactory
In explanation vid, we delete the node before sink() but in code, sink() happens before deleting the node. Can you explain?
The source code on GitHub is the source of truth, the explanation videos sometimes have typos
I have trouble understand the degree?