1. A leftist heap is a type of priority queue that is implemented using a variant of a binary heap. It attempts to be very unbalanced in contrast to a binary heap, which is always a complete binary tree. 2. Key operations on a leftist heap like insert, delete minimum, and merge have O(logN) time complexity. Merge is particularly efficient compared to a binary heap which has O(N) time complexity for merging. 3. Properties of a leftist heap include the minimum key property and the property that the right descendant of every node has a smaller s-value (distance to the nearest leaf). These properties allow leftist heaps to efficiently support merge in O(log