Hierarchical Heap is a very efficient Priority Queue O(log n/k) for large data sets.

Writing O(1) high performance data structures, in order to learn Go.