Sort an input list using leftist tree-based heapsort
Sorts an input list by first INSERT-LTing each element of the list into a leftist tree, then DELETE-MIN-LTing the min element from the tree one by one.
