7.1 Fibonacci Heap | Properties | Introduction | Advanced Data Structures

[@MGSquad2024]

Finding minimum - Binomial Heap - O(log n). since there are no pointer to direct the minimum, Insert also same as finding minimum.

[@venkateshr2576]

Super explained bro

[@uzairjavedakhtar3718]

Glad that you liked it🖤 Please share with all your friends🙂

[@kirandevadiga9615]

just wanted to point out that fibonacci heap doesn't allow multiple trees with the same degree 4:24

[@markolumbar4307]

that not true

[@Advt1234]

Hello Sir, can you please make a detailed video on operations on skew heap and priority queue with pseudo code? that would be of great help !!

[@bhumikabansal6022]

lovely!!!!!!!!

[@uzairjavedakhtar3718]

Thanks Bhumika😊 Please share the channel with your friends🖤

[@tekbssync5727]

Please upload videos on Geometric DS like interval trees, priority search trees, segment trees or provide us some good resources to learn them 🙏🙏

[@uzairjavedakhtar3718]

Will upload asap! Now even my exams are going on😁

[@lxshya]

good stuff

[@uzairjavedakhtar3718]

🤩

[@aramvijay]

god bless u

[@Phoenix-sh8vg]

My man you are fucking nice with it, great job

[@yuvrajagarkar8942]

Detailed, Loved it ❤, thank you

[@uzairjavedakhtar3718]

Thanks Yuvraj😊

[@jasondeb2678]

bro could u upload the other videos asap please

[@uzairjavedakhtar3718]

Yes I am on it. Trying my best!

[@GauravGupta-tf3of]

thank you so much for these videos

[@ranjeetkumar2051]

thank you very much for making this video very helpful ❤❤❤❤❤❤❤❤❤❤❤❤❤❤💕💕💕💕💕💕💕💕💕💕😘😘😘😘

[@RomaisasafderRomaisasafder]

Sir your method is good but it would be much good if you explain in urdy😊