+1 vote
in Data Structures & Algorithms I by (88.2k points)
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 Answer

+1 vote
by (672k points)
selected by
 
Best answer
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.

Related questions

Welcome to TalkJarvis QnA, a question-answer community website for the people by the people. On TalkJarvis QnA you can ask your doubts, curiosity, questions and whatever going in your mind either related to studies or others. Experts and people from different fields will answer.

Categories

...