Consider a min heap.
When one element is deleted , and you take an element from the right most leaf and place it at root.
Now think , do u need to check with all the elements , and both the sub trees? No right?
So time complexity of heapification is O(h) .
Asymptotically each deletion will cause heapification to take place , and each heapification would take log(n) time .