My thoughts-->If it's a min heap: then we can find minimum in O(1) and delete minimum in O(logN);
if it's a max heap: then we can find minimum in O(N)(check all leaves) and delete minimum in O(N) ( taking search minimum first into account) or O(1) if we don't care the searching time
Pls correct me if i am wrong
Correction: for max heap, delete mim should be
O(logN) if we don't care the search time instead of O(1)
Huasing Association 1999 - 2013