title: Time complexity of the Heap pop operation
body: <p>For a long time, I have been assuming that the time complexity of the pop operation on a Heap is <code>O(1)</code>.</p>
  
  <p>Is it <code>O(1)</code> or <code>O(log(n))</code> ?</p>