Data Structures in Typescript #17 - Binomial Heap Introduction

[@BelegaerTheGreat]

Video beginning with a quote from Hofstadter and Minecraft music, this has to be good. Edit: Yep, you deserve my lecturer's salary.

[@onurcanisler]

*Nothing in the world could be better than an intro with C418 piano song.*

[@emmatime2016]

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!

[@karencastelino1793]

This is so simple and easy to follow! Excellent explanation!

[@M0niqa91]

Excellent explanation! Thank you!

[@acheacjun]

really well explained, appreciate

[@_gauravkumar]

Amazing explanation🙌

[@shashanksharma21]

Amazing explanation !!

[@captainjow1518]

amazing work

[@rahmanmustafayev6843]

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?

[@christianispas787]

Very Useful!

[@THVLPLYR]

brilliant tutorial !!!

[@icheckedavailability]

clear explanations, thanks

[@shutaoshen8115]

thank you! good intro!

[@jan.k.]

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.

[@jacksonchen8679]

I think that he just want to tell us what is left-child right-silbing tree.

[@alchemist6508]

You know Skew Binomial Heap?

[@Harshulify]

Thx