Variants of heaps

There are several data types that are similar to heaps, except that they support a merge operation of O(log n) time complexity.  

Note that insert can be thought of as merging with a heap of size 1,
and deleteMin can be thought of as merging the children of the root.

For some of these types, the insert operation does not have O(1) average-case time complexity.