The skew binomial heaps described in Okasaki\'s Purely Functional Data Structures support merge in worst-case O(log (max (m,n))) time, where m
O(log (max (m,n)))
m
