This algorithm for priority queues is due to
Introduction to Algorithms
by T. Cormen, C. Leiserson, R. Rivest.
1989 MIT Press.
Returns a binary heap suitable which can be used for priority queue operations.
Inserts item into heap. item can be inserted multiple times. The value returned is unspecified.