What is the time per operation of merging, insertion and deletion operations in a skew heap?
(b) O(log N)
(c) O(N log N)
I need to ask this question from Heap topic in division Heap of Data Structures & Algorithms I
This question was posed to me during an interview.