title: Deletion in binary heap
body: <p>I am just trying to learn binary heap and have a doubt regarding doing delete operation in binary heap.
  I have read that we can delete an element from binary heap and we need to reheapify it.</p>
  
  <p>But at the following link, it says unavailable:</p>
  
  <p><a href="http://en.wikibooks.org/wiki/Data_Structures/Tradeoffs" rel="noreferrer">http://en.wikibooks.org/wiki/Data_Structures/Tradeoffs</a></p>
  
  <pre><code>                Binary Search  AVL Tree   Binary Heap (min)  Binomial Queue (min)
  
  Find            O(log n)       O(log n)   unavailable         unavailable
  Delete element  O(log n        O(log n)   unavailable         unavailable
  </code></pre>
  
  <p>I am little confused about it.</p>
  
  <p>Thanks in advance for all of the clarifications.</p>