# Which of these operations have same complexities?

Category: QuestionsWhich of these operations have same complexities?
Editor">Editor Staff asked 5 months 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.

Editor">Editor Staff answered 5 months 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.

Notice: Trying to get property 'ID' of non-object in /home/fvckxqmi/public_html/wp-content/themes/blocksy/inc/single/single-helpers.php on line 17

Notice: Trying to get property 'ID' of non-object in /home/fvckxqmi/public_html/wp-content/themes/blocksy/inc/single/single-helpers.php on line 17

Notice: Trying to get property 'ID' of non-object in /home/fvckxqmi/public_html/wp-content/themes/blocksy/inc/single/single-helpers.php on line 17

Notice: Trying to get property 'ID' of non-object in /home/fvckxqmi/public_html/wp-content/themes/blocksy/inc/single/single-helpers.php on line 17
Articles: 40702