Which of these operations have same complexities?

Category: QuestionsWhich of these operations have same complexities?
Editor">Editor Staff asked 1 month ago

Which of these operations have same complexities?
 
(a) Insertion, find_min
 
(b) Find_min, union
 
(c) Union, Insertion
 
(d) Deletion, Find _max
 
Query is from Binomial and Fibonacci Heap in section Heap of Data Structures & Algorithms I
 
This question was posed to me in an online quiz.

1 Answers
Editor">Editor Staff answered 1 month ago

Correct option is (c) Union, Insertion
 
The best I can explain: With proper implementation using link list find_min and find_max operation can be done in O(1), while the remaining takes O(logn) time.