Time taken in decreasing the node value in a binomial heap is?
How the answer is O(logN)?
Won’t, finding the node alone take O(N) time in worst case, as it is not a BST, we might need to traverse all the elements in order to search the node, whose value we want to decrease?