Choose The Option With Function Having Same Complexity For A Fibonacci Heap.

› Category: Questions › Choose the option with function having same complexity for a fibonacci heap.

Editor Staff asked 5 months ago

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.

Question Tags: Interview-Questions-Answers

1 Answers

0 Vote Up Vote Down

Editor">

Editor Staff answered 5 months ago

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 Posts

Most commonly asked OpenAI interview questions and answers

Common AI interview questions and answers:

How do you uninstall gulp?