Fibonacci heaps in 6 minutes - Intro

[@MichaelSambol]

Hopefully the audio is crystal clear. I updated some settings in iMovie. Let me know if you have any issues. 👍🏼

[@flower77769]

I don't know about mobile but your previous videos discussing red-black trees had better audio. Your voice in this one sounds more compressed, still good quality but wouldn't call it crystal clear quality, which in my opinion rbt vidoes had. I'm using hyperx Cloud 2 headphones plugged straight into z490 mobo. Anyways great video.

[@MichaelSambol]

@@flower77769 Will keep tuning, thanks for the feedback. 👍

[@DawnKylin]

3:28 I think the second one is not a min-heap. Min-heap is complete binary tree.

[@IcyClench]

A heap is any tree that satisfies the heap property: the key of a node is >= the key of its parent. You are thinking of a binary heap (as in binary-tree heap) that's implemented as an array (since an array can represent a complete tree).

[@ll-bc4gn]

so why do we call it fibonacci?

[@reold]

because it uses fibonacci numbers during its runtime analysis read it on wiki

[@D3ebK]

Awesome information! Thank you!

[@ramizrizwan3057]

Your videos are so helpful

[@MichaelSambol]

thanks, Ramiz!

[@Angelfromdasky]

I LOVE YOU. Thank you for your videos.

[@MichaelSambol]

❤️👊🏼

[@Fast_Tutorials]

thank you!

[@FantaPopRockz]

I love your videos!!

[@kwanyupensuk7812]

Nice one.

[@icemotion1925]

overly complex data structure, feels like it's only useful theoretically...

[@callmeshen9754]

It's still considered worthy to implement for Dijkstra's & Prim's algorithms for a certain maps.