Research work · 2007

Leftist Heap Data Structure

Sally A. Goldman, Kenneth. J Goldman

Chapman & Hall/CRC eBooks

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.

DOI: 10.1201/9781420010336-32