+1 vote
in Data Structures & Algorithms I by (88.2k points)
The Statement “Fibonacci heap has better amortized running time in compare to a binomial heap”.

(a) True

(b) False

My doubt stems from Binomial and Fibonacci Heap in chapter Heap of Data Structures & Algorithms I

I got this question in final exam.

1 Answer

+1 vote
by (672k points)
selected by
Best answer
Correct choice is (a) True

Best explanation: Overall complexity of insertion, merging, deleting is in order of O((a+b)logn) For Fibonacci the complexity reduces to O(a+ blogn).

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.