But I think it can-->For example, for an array based min heap, inserting a value larger than the maximum of original heap will tabke O(1) time if bottom-up algorithm is applyied
Correct me if i am wrong
sorry...I didn't notice the "best-case time" there
In that case, I re-read the question, and I think I'll post C as the answer.
Huasing Association 1999 - 2013