title: Best case time complexity of deletion in Max-Heap
body: <p>I've been told that the best case time complexity of deleting an element from a max heap is O(1).</p>
  
  <p>From what I understand, the best case should be O(logn) since we always have to perculate down after deleting the root and placing the last eleement in the heap at the root.</p>
  
  <p>Then the question is - how could the best case be O(1)</p>
  
  <p>Thanks in advance</p>