Vidyalelo
Data Structure · Q125

Heaps

Programming · Data Structure · question 125

Q125

Choose the option with function having same complexity for a fibonacci heap.

A.
Insertion, Union
Answer
B.
Insertion, Deletion
C.
extract_min, insertion
D.
Union, delete

Answer: Option A

Solution

Answer: Option A
No explanation is given for this question Let's Discuss on Board