title: Why heappop time complexity is O(logn) (not O(n)) in python?
body: <p>For a list, the heappop will pop out the front element. Remove an element from the front of a list has time complexity O(n).
  Do I miss anything?</p>