Data Structures in Typescript #22 - Fibonacci Heap Introduction

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


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

Wow! You explain things so clearly. And you keep it from being boring. Thanks for taking the time to explain this. :)

maryspikowski
Автор

Great work. The part about exact-min efficiency is great.
None of lecture for me to learn Data Structures tell me about this part.

jacksonchen
Автор

I love the clear explanation. You saved my semester.

clehaxze
Автор

how about if the node in the tree had only 4 children, will that make it of order 4? and if yes, then then how comes that min. number of nodes is Fk+2 ? F6 = 8 and here we have 5 nodes (4 children + parent node)

TareqTawalbehThe_Script
visit shbcf.ru