7.3 Fibonacci Heap | Extract Minimum operation | Delete Minimum | with Time Complexity

Поделиться
HTML-код
  • Опубликовано: 8 сен 2024

Комментарии • 24

  • @rudranshprem1983
    @rudranshprem1983 Год назад +4

    today is my exam and after searching all the contents in youtube , i saw your lecture . you taught the best way . hats of sir

    • @uzairjavedakhtar3718
      @uzairjavedakhtar3718  Год назад

      Your this appreciation means a lot
      I am really happy to know that this lecture helped you 😊
      Kindly share the channel with your friends and juniors in college

  • @g51661
    @g51661 11 месяцев назад +2

    Thanks a lot sir. Respect and Gratitude

  • @priya82122
    @priya82122 Год назад +2

    Fabulous sir. Thank you very much for your effort to teach in best possible way.

    • @uzairjavedakhtar3718
      @uzairjavedakhtar3718  Год назад

      Thanks A Lot for taking out some time to appreciate my efforts☺️
      Please share the channel if it helped you🖤

  • @crazyotaku5754
    @crazyotaku5754 2 года назад +1

    This lecture was a life saver. It was impossible for me to understand this concept without your help sir. Thanks a lot

    • @uzairjavedakhtar3718
      @uzairjavedakhtar3718  2 года назад

      I am glad that the video was of some help to you..Keep Learning and Growing😊

  • @maisiez882
    @maisiez882 Год назад +1

    Thanks so much for these videos on Fib heaps, saving me in my algorithms class

  • @ash27kan
    @ash27kan 4 месяца назад

    Thanks a lot 🙏

  • @animeshpandey2911
    @animeshpandey2911 Год назад +1

    what an explanation....glad I found it

    • @uzairjavedakhtar3718
      @uzairjavedakhtar3718  Год назад

      And I am equally glad that you chose to acknowledge the content😉🙂
      Keep growing🖤👍👍👍

  • @ranjeetkumar2051
    @ranjeetkumar2051 2 года назад +1

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

    • @uzairjavedakhtar3718
      @uzairjavedakhtar3718  2 года назад

      I am glad that you found my video so helpful☺️ Please share🖤🖤🖤

  • @ankitaakodiya6074
    @ankitaakodiya6074 2 года назад +3

    Boss if it's possible can you please upload video lectures on treaps ,skip list and trie.

    • @uzairjavedakhtar3718
      @uzairjavedakhtar3718  2 года назад +1

      Yeah sure, My upcoming videos are on all these data structures itself🙂
      Kindly share the channel as much as possible

    • @ankitaakodiya6074
      @ankitaakodiya6074 2 года назад +1

      @@uzairjavedakhtar3718 thank you Boss 👍🏻

  • @unacademyshah6321
    @unacademyshah6321 Год назад +1

    Awesome explanation, bit slow , play at 2x

    • @uzairjavedakhtar3718
      @uzairjavedakhtar3718  Год назад

      Great suggestion! 🙂
      Maybe it's your mind that runs at the speed of sound🤩😉

  • @susmitjaiswal136
    @susmitjaiswal136 2 года назад +5

    dsa playlist are many ...but you stand apart...advance dsa...

    • @uzairjavedakhtar3718
      @uzairjavedakhtar3718  2 года назад

      Thanks for your kind words 😊 please share this playlist with your friends

  • @user-nj4il1ey1f
    @user-nj4il1ey1f Год назад

    May I ask that the worst case of extract-min would be O(n) ,after I insert n node?

  • @arnd12940
    @arnd12940 Год назад +1

    12:38 why 64 is left side of 14?