Great video! I am studying Advanced Algorithm now and encountered this data structure. I have gone through a lot of documentations and videos and you are the best!
How is looking up a value in binary heap takes a constant time? Don’t we have to go through all the heap nodes to check if the node exists? Can anyone explain me that?
Great video. But at minute 27:54 you showed an ASCII representation of a tree and I was wondering if it's allowed for A to have two children with a rank of one (C and E) or if I missed something there. Thank's in advance and keep up the good work.
Video beginning with a quote from Hofstadter and Minecraft music, this has to be good.
Edit: Yep, you deserve my lecturer's salary.
*Nothing in the world could be better than an intro with C418 piano song.*
Great video! I am studying Advanced Algorithm now and encountered this data structure. I have gone through a lot of documentations and videos and you are the best!
This is so simple and easy to follow! Excellent explanation!
really well explained, appreciate
Excellent explanation! Thank you!
Amazing explanation🙌
clear explanations, thanks
amazing work
Amazing explanation !!
Very Useful!
thank you! good intro!
brilliant tutorial !!!
How is looking up a value in binary heap takes a constant time? Don’t we have to go through all the heap nodes to check if the node exists? Can anyone explain me that?
Great video. But at minute 27:54 you showed an ASCII representation of a tree and I was wondering if it's allowed for A to have two children with a rank of one (C and E) or if I missed something there. Thank's in advance and keep up the good work.
I think that he just want to tell us what is left-child right-silbing tree.
Thx
You know Skew Binomial Heap?