in this video, I have explained how the Heap Data structure works using a visual representation of Max Heap.
I have included the insertion, deletion, and building heap from array operation along with their Python implementation code.
also at the last, I've explained How this is used to build priority queues.
The Voice in the video is not mine, it is generated using an online TTS tool so sometimes accent or speed might contrast.
GitHub Repo:- https://github.com/ByteQuest0/Implemention_codes/blob/main/Heaps/heap.py
This channel also has similar animated #algorithms and #data structure videos that you might find useful:-
Knuth-Morris-Pratt Algorithm:- https://youtu.be/q4_90fOoS-s
Depth First Search Algorithm:- https://youtu.be/84jNzUOY78c
Graphs Introduction:- https://youtu.be/OpW4exs0PHI
Binary Search Trees:- https://youtu.be/vPfLvtk9dfk
Linked Lists:- https://youtu.be/PsTvZ_htHT8
Music Used:
Sovereign by Kevin MacLeod | https://incompetech.com/
Music promoted by https://www.chosic.com/free-music/all/
Creative Commons CC BY 3.0
https://creativecommons.org/licenses/by/3.0/
Tools Used: #manim Python Library and Premier Pro.
