The worst case running time of all operations in a skew heap is given as?
(b) O(N log N)
(d) O(M log N)
My query is from Heap topic in section Heap of Data Structures & Algorithms I
The question was posed to me in an online interview.