Binary heaps are very practical data structures used in a variety of algorithms — including graph searching algorithms, compression algorithms, and more. Here, we explore how binary heaps work: what they're used for, how to add new data into them, and how to remove data from them once we're done.
0:00 Priority Queues
1:31 Binary Heaps
2:99 Insertion
6:04 Deletion
Note that the tree shapes presented in this video differ slightly from the traditional implementation of binary heaps, where the lowest level of the tree is filled with nodes from left to right. The implementation presented in this video is adapted from Stuart M. Shieber's "Programming Well: Abstraction and Design in Computation".
***
Spanning Tree is an educational video series about computer science and mathematics. See more at https://spanningtree.me
To be notified when a new video is released, sign up for the Spanning Tree mailing list at https://spanningtree.substack.com/
Spanning Tree is created by Brian Yu. https://brianyu.me/
Email me at [email protected] to suggest a future topic.
