Data Structures in Typescript #17 - Binomial Heap Introduction

preview_player
Показать описание


Рекомендации по теме
Комментарии
Автор

Video beginning with a quote from Hofstadter and Minecraft music, this has to be good.

Edit: Yep, you deserve my lecturer's salary.

BelegaerTheGreat
Автор

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

onurcanisler
Автор

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!

emmatime
Автор

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

karencastelino
Автор

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.

jan.k.
Автор

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?

rahmanmustafayev