Putting values 3, 1, 4, 2, 5 in a leftist heap.
The value inside the parenthesis is tree rank.

3(1)


3(2)
  1(1)


   4(2)
3(2)
  1(1)


    4(2)
2(1)    3(2)
           1(1)


      5(2)
  4(2)    3(2)
2(1)        1(1)


Sorting the array by repeatedly deleting the largest element of the tree.
See L1.hs for detailed algorithm.

Max element: 5

    4(2)
2(1)    3(2)
          1(1)


Max element: 4

    3(2)
2(2)
  1(1)


Max element: 3

2(2)
  1(1)


Max element: 2

1(1)


Max element: 1

Empty

Sorted list: [5, 4, 3, 2, 1]