Fibonacci heaps in 6 minutes - Insert & Union

[@murnoth]

I've enjoyed learning from your content in recent months and I'm stoked to see you're returning with more

[@MichaelSambol]

Thank you! I appreciate the support.

[@yhoang6674]

In union function, section 'fix pointers to combine root lists' the last line was FH.root_list.left.right = FH.root_list should be FH2.root_list.left.right = FH.root_list, right?

[@MichaelSambol]

take you take a look here? github.com/msambol/dsa/blob/master/data_structures/fibonacci_heap.py#L61-L66 draw two simple heaps and go through the process of moving pointers.

[@שיראדלר]

the insert will always be to the root_list? how are the rest of the layers formed then? תודה מראש!

[@ahmednesartahsinchoudhury2628]

This video is great. Couldn't find the extractMin and decreaseKey videos. Did you make them?

[@MichaelSambol]

Extract min will be out this week! I pushed code last night if you want to take a look: github.com/msambol/youtube/blob/master/data_structures/fibonacci_heap.py

[@arzoobapna5148]

Thank you so much! I couldnt figure out the clrs pseudocode for my life! Im so thankful for this video. You saved me so many tears. Deletion video please?

[@MichaelSambol]

In the works! Thanks for watching.

[@heyitspixl]

wtf are you a mind reader how do you post videos exactly on what i need the moment i need them lolol

[@barto_e]

hey man you right? love your vids I learn a lot with them

[@MichaelSambol]

Doing well, more coming! Thank you for watching. 💪🏼