Heaps Visually Explained (Priority Queues)

preview_player
Показать описание
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.

This channel also has similar animated #algorithms and #data structure videos that you might find useful:-

Music Used:
Creative Commons CC BY 3.0

Tools Used: #manim Python Library and Premier Pro.
Рекомендации по теме
Комментарии
Автор

incredibly clarifying, to the point, thank you!

amuerta
visit shbcf.ru