ABSTRACT
Strengths: The leftist heap supports a logarithmic time operation to merge two heaps. All other methods have the same asymptotic time complexities as the binary heap.
Weaknesses: Space usage is significantly higher than for the binary heap, especially if it is threaded to support constant-time iteration.
