Despite heap structure being both space and time efficient, it is NOT suitable for all applications of priority queues
Leftist tree structures are useful for applications
to meld (i.e., combine) pairs of priority queues
using multiple queues of varying size
Leftist tree is a linked data structure suitable for the implementation of a priority queue
A tree which tends to “lean” to the left.