go-data-structures

Priority Queue with Binary Heap The classic way to implement a priority queue is using a data structure called a binary heap. A binary heap will allow us to enqueue or dequeue items in O(logN).