+1 vote
in Data Structures & Algorithms I by (88.2k points)
Choose the option with function having same complexity for a fibonacci heap.

(a) Insertion, Union

(b) Insertion, Deletion

(c) extract_min, insertion

(d) Union, delete

My question is from Binomial and Fibonacci Heap in portion Heap of Data Structures & Algorithms I

I had been asked this question by my school teacher while I was bunking the class.

1 Answer

+1 vote
by (672k points)
selected by
 
Best answer
The correct option is (a) Insertion, Union

Easiest explanation - For a fibonacci heap insertion, union take O(1) while remaining take 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

...