6.4 All Operations in Binomial Heaps | Advanced Data Structures

[@skyleaned]

Thank you sir. So far this is the clearest explaination on youtube

[@uzairjavedakhtar3718]

You are most welcome😊

[@hrmIwonder]

Thank you for making these videos! These last 4 on binomial heaps were wonderfully explained! It's a cool data structure, now I should be able to go read about applications of them.

[@uzairjavedakhtar3718]

Its so kind of you to come here & acknowledge my efforts in the binomial heap videos..Means a lot😊...If it helped you, you can share this playlist with your friends😉

[@akshatsaxena1888]

best explanation about concepts thanks a bunch sir

[@manusabuu]

Your hardwork will pay off sir💯

[@uzairjavedakhtar3718]

If it's helping you and others, then my hardwork is definitely paying off already😉😊

[@_DivyanshuYadav]

you have delivered good lecture on this topic ...thank you ❤

[@uzairjavedakhtar3718]

Thanks for your kind words🖤

[@AdelNourbakhsh-v9u]

thanks a lot . awesome teaching.

[@froggychair28]

amazing explanation ☺

[@uzairjavedakhtar3718]

Thanks😊

[@mr.curious1329]

Well done!

[@uzairjavedakhtar3718]

Thanks 🖤 Enjoy learning.

[@ishankumar4306]

good content

[@uzairjavedakhtar3718]

Thanks for appreciating😊

[@tekbssync5727]

8:40 I think some explanation part is missing in insert section

[@uzairjavedakhtar3718]

Yes, Kindly see the description of this video :)

[@smitbhatt9155]

@@uzairjavedakhtar3718 where has it been added?

[@uzairjavedakhtar3718]

@@smitbhatt9155 I mean that I have already mentioned in the description what is missing and why. Whenever possible in future, I shall add that one operation.

[@shahidraza7965]

@@uzairjavedakhtar3718 is the insert part added?

[@chanukyamaruthisuravarapu2540]

In decrease key operation we need to find that element first ryt? it requires O(n) time to find that element in whole binomial heap in worst case. Decrease key complexity needs to be O(n) ryt?