Time Taken In Decreasing The Node Value In A Binomial Heap Is

› Category: Questions › Time taken in decreasing the node value in a binomial heap is

Editor Staff asked 5 months ago

Time taken in decreasing the node value in a binomial heap is

(a) O(n)

(b) O(1)

(c) O(logn)

(d) O(nlogn)

I’m obligated to ask this question of Binomial and Fibonacci Heap in portion Heap of Data Structures & Algorithms I

The question was posed to me in exam.

Question Tags: Interview-Questions-Answers

1 Answers

0 Vote Up Vote Down

Editor">

Editor Staff answered 5 months ago

Correct option is (c) O(logn)

Explanation: Decreasing a node value may result in violating the min property. As a result be there would be exchange in the value of parent and child which at max goes up to height of the heap.

Related Posts

Most commonly asked OpenAI interview questions and answers

Common AI interview questions and answers:

How do you uninstall gulp?