Min heap tree in Data structure || 52 || Data structures in telugu

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

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

  • @tirlangikulasekhar915
    @tirlangikulasekhar915 4 года назад +5

    Yes madam... sortings,trees valla nenu kooda sem exams Baga raasanu mam...thank you mam

  • @gayathrikodati5512
    @gayathrikodati5512 4 года назад +5

    Mam thank you so much mi Videos nak Chala chala use ayayi. Ninna jargina data structures exam baga rasanu Mam. Mi way of teaching super Mam once again Thank you so much

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

    Tq mam for the brief explanation and it's very useful to me

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

    Madam I really appreciate your teaching ,I am hindi u r teaching in Telugu then also I understood your concept very briefly explain, highly appreciated ma'am.

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

      Thank u so much

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

    Mam code ni kuda implement chesthey chala chala baguntadhi utube lo chala thakkuva channels unnai mam Java lo ds

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

      Yes thank you for your suggestion

  • @vidhyavarunikaviva4217
    @vidhyavarunikaviva4217 2 года назад +2

    Tq so much mam

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

    Man don't we have to make binary tree with scanning every time ?

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

      That is the rule

  • @Kiran-CSM
    @Kiran-CSM 2 года назад

    Mam konchm chapter wise imp questions for data structures oka vedio cheyandi
    It'll be very helpful to us

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

      Important questions: ruclips.net/p/PLJSrGkRNEDAi01LMuH81AozPUKBFtQuyv

  • @vedabharadwaj763
    @vedabharadwaj763 3 года назад +7

    why did you not swap 25 and 26 when 25 is lesser than 26

    • @Lab_Mug
      @Lab_Mug  3 года назад +1

      Waiting for another child then i will check from 3 values who is less

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

      This step is wrong or right?

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

    Why 26 was taken left side when root node is 24?

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

      Step by step min heap applied so first 24 less than 26 that is the root

    • @MaheshVollipimahesh
      @MaheshVollipimahesh 22 дня назад

      Bro Here in heap Dont follow any rule because it is a not bst

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

    👏👏👏

  • @Maabipinjari
    @Maabipinjari 2 месяца назад

    Mam 35 is greater compared with root number number so u have to put in right side u did mistake mam

    • @Lab_Mug
      @Lab_Mug  2 месяца назад

      Once I will check it

  • @SUNIL-w1r8d
    @SUNIL-w1r8d 26 дней назад

    Alacheyalo chepandi anduk swap cheyali ala a
    Swap cheyali clarity evandi kothaga chusevali mind nosadhi madam😅

    • @Lab_Mug
      @Lab_Mug  26 дней назад

      Nenu clear ga ne chepa heap nundi skip cheyakunda vinte ardam avutundi

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

    Madam kucncham sorting kuda pettandi pls🥺🥺

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

    Reply ivvadam marchipokandi mam