Some facts about a Min-Heap:

• O(log(n)) insertion time complexity

• O(log(n)) deletion time complexity

• The minimum value is always present at the top of the heap

• This is maintained using a 'heapify' method at insertion, which maintains the minimum at the top

Here is a diagram of an insertion, for example: