Use a heap to implement a stack.

Use a heap to implement a queue

Use a heap to implement heap-sort function

Use a heap to find the k-th largest element in N items in roughly O(N) time when k is small or close to N

Create a median heap, which extracts the median, from a set of values using two heaps.

Give an O(n lg k) - time algorithm to merge k sorted lists into one sorted list, where n is the total number of elements in all the input lists

To speed up development and allow us to focus on the uses of the heap datastructure, here are links to libraries which implement the heap data structure (aka Priorty Queue). One Javascript implementation is provided in this repository in datastructures/

http://www.cplusplus.com/reference/queue/priority_queue/

http://docs.oracle.com/javase/7/docs/api/java/util/PriorityQueue.html

https://docs.python.org/2/library/queue.html

gem install pqueue

http://www.rubydoc.info/gems/pqueue

https://www.npmjs.com/package/algorithms