Define min-heap
A min-heap is a complete binary tree in which each element is less than or equal to its children. All the principal properties of heaps remain valid for min-heaps, with some obvious modifications.