Heap on Data Structure and Algorithms related Questions and Answers

Question :   Time taken in decreasing the node value in a binomial heap is 1. O(n) 2. O(1) 3. O(logn) 4. O(nlogn) Answer :   3 - O(logn)