Redo O(n) version of mkbaltree

Priority queues

  Representation in terms of lists, sorted lists, balanced search
  trees

  Priorities will not be unique, in general.  Need to deal with
  duplicates

Heaps

Making a heap from a balanced tree : 


Leftist heaps

Union of leftist heaps

Implementing insert

Sorting using heaps