binary heap cannot perform insert in O(1).Trace the insert algorithm for binary heap, and you'll know why.
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
Correct me if i am wrong
Huasing Association 1999 - 2013