Heapq Module And Priority Queue | Binary Heap | Python Tutorials

Поделиться
HTML-код
  • Опубликовано: 29 июн 2024
  • In this Python Programming video tutorial you will learn about heapq module and priority queue in detail.
    Data structure is a way of storing and organising the data so that it can be accessed effectively.
    Tree is a non linear data structure contains group of nodes connected via links or edge.
    Binary Heap Operations:
    • Binary Heap Operations...
    Binary heap is a complete binary tree with heap property.
    heapq.nsmallest(n,iterable,key=None)is equal to sorted(iterable,key=key)[:n]
    #DataStructures #PythonPrograms #Tree
    For more free tutorials on computer programming
    / amulsacademy
    AmulsAcademy

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

  • @TechWithSabri
    @TechWithSabri 3 года назад +11

    Hi Amulya i just want to say THANK YOU SO MUCH for your time, thank you for the description of these DATA STRUCTURES
    because of you today i can make a linked list, Graphs, Trees, and more.
    .
    .
    Thank you is not enough for all of these wonderful videos.
    thanks again we love you keep going

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

      Glad to hear that ❤️😊

    • @bb-xj9ed
      @bb-xj9ed 6 месяцев назад +1

      @@AmulsAcademy you're awesome sis

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

    Thank you for the video. I am grateful for your time and contribution. Kind regards, Akira.

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

    Best series of DS through PYTHON.

  • @BECSE-SSubiramaniyan
    @BECSE-SSubiramaniyan 3 года назад +4

    Accidentally Finded a Awesome Channel 🤩 Your videos are Really Great💯 Especially Flames video (bcoz that was first video i watch in your channel 😅)

  • @mohittrivedi1112
    @mohittrivedi1112 3 года назад +4

    One of the finest python tutorial, great work🙏

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

      Thank you 😊

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

      @@AmulsAcademy if possible can you work on any project or build a application using python concept please, your thorough explanation is so good, it would help many to decode complexity
      Thanks again 🙏

  • @SAURABHYADAV-no5tv
    @SAURABHYADAV-no5tv 2 года назад

    great work mam .....really Awesome...

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

    Hi Amulya, what software did you use for making this presentation? The video is well-made and seems the software was easy to work with.

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

    Please explain the implementation of max heap for priority queue also where max value gets high priority

  • @suryajanardhan
    @suryajanardhan 3 месяца назад

    What if there are duplicates in the list then how heap is formed and what will be the output for n smallest and n largest?

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

    Your voice seems like a 10 year old kid.And and I caught you pronouncing "yen" in place of "n" which tells you are a South Indian🤣.Great work by the way

  • @professorschoice8447
    @professorschoice8447 2 года назад +4

    Ma'am, What if we want to implement max heap?

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

      Use min heap with negated elements

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

    Mam how to delete a particular value with heapq

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

    thank you ma'm

  • @informationguru1200
    @informationguru1200 3 года назад

    Great

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

    what is the difference between heappushpop() and heapreplace() if both are doing push and pop operation ?

    • @goganii
      @goganii 7 месяцев назад +1

      I think what differs is the order, pushpop does push then pop, while replace is the opposite

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

    👍

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

    Mam can you tell how to write a program using both search and sort the user should select the search or sort pls mam help me😭😭😭😭😭😭😭

    • @AmulsAcademy
      @AmulsAcademy  3 года назад

      Ask the user for input , which operation he want to do then use if else conditional statement 😊

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

    Mam this data structure and algorithms help me to ace coding interview

    • @AmulsAcademy
      @AmulsAcademy  3 года назад

      😊

    • @bibeksharma600
      @bibeksharma600 3 года назад

      what are the types of question asked bro ? Also from where did you practise the questions !!!!

  • @ganeswarreddy4030
    @ganeswarreddy4030 3 года назад +3

    can you make videos on gui (TKinter)

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

      Will try 😊

    • @ganeswarreddy4030
      @ganeswarreddy4030 3 года назад

      @@AmulsAcademy we will be desparetely waiting for that moment mam tq for ur response

    • @ganeswarreddy4030
      @ganeswarreddy4030 3 года назад

      @@AmulsAcademy and we also waiting for tensor flow videos mam

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

    🥰🥰🥰

  • @bb-xj9ed
    @bb-xj9ed 6 месяцев назад

    you're awesome sis

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

    Can you teach algorithms mam?

    • @AmulsAcademy
      @AmulsAcademy  3 года назад

      Will try 😊

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

      @@AmulsAcademy ok mam😊

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

      😊

    • @rajeshnamburi1586
      @rajeshnamburi1586 3 года назад

      @Pranay 1234 greedy algarithm, dynamic programming like that

    • @rajeshnamburi1586
      @rajeshnamburi1586 3 года назад

      @Pranay 1234 algorithm means you have to follow some steps and crt approach.Then you have to solve a problem with efficient way

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

    Plz make a facecam video