Binary Heaps (Priority Queue) in Go - This is the fourth video of a multi-part series covering data structures and algorithms in Golang. In this programming tutorial I discuss the concept of Binary Heaps.
Binary Heaps are often referred to as a priority queue. This is a special type of queue in which each element is associated with a priority value. And, elements are served on the basis of their priority. That is, higher priority elements are served first.
Throughout the video I provide an thorough explanation of a Binary Heap. I discuss the differences between a min heap and max heap, show to how create one in code and provide visual illustrations to explain how to resort the binary heap after an inerstion or deletion.
Intro 00:00
Insertion 10:00
Visual of Insertion and HeapifyUp 11:00
Explanation for HeapifyUp code 13:00
Deletion 14:35
Visual of Deletion and HeapifyDown 15:50
Explanation for HeapifyUp code 17:00
