Assuming a binary min-heap with natural ordering.

       1
  50       20
60   70  90   30

If we are removing '60' from this heap, replacing it with the last heap element '30' requires a filter-up to maintain heap property.