[6.2] Heaps Implementation in Python | Data Structures in Python

In this tutorial we will code heap data structure in Python.
For full code go to our website given below.
🔗Important Links:
Data Structures in Python: www.thinkxacademy.com/Data%20...
🌐Join our community:
Android App(Notes+Videos): play.google.com/store/apps/de... Facebook: / thinkxacademy Twitter: / thinkxacademy Instagram: / thinkxacademy
#heaps #python #datastructures

[@user-fq5eq7cd4p]

what extension do you use to which prints the error like not defined etc?

[@ivanroy1059]

very well explained.... could you please share how to insert and pop as well

[@ThinkXAcademy]

sure i will definitely make a video on this👍🏻

[@admine7787]

code editor use use and extention?

[@avinashpai9074]

Loved all your videos. Easy to understand. thanks for your time sharing and making it easy. I have one question though. Is recursive call of the function required? I tried with removing it and worked fine for me. Would you please tell me the use of recursion here?

[@ThinkXAcademy]

Thanks👍🏻Recursive call is important to perform heapify on all nodes. You may have got right result without using it but it won't work for every case.

[@ThinkXAcademy]

Please share my videos to help this channel grow💯

[@dylancampbell6433]

If it is a max heap why is 10 further in the tree than 9?

[@azmirvali6205]

Order of output manually☹️-66,9,30,2,5,10 but there 5,2 how?