A min-heap is a complete binary tree data structure where the value of each node is less than or equal to the values of its children, ensuring the smallest element is always at the root. This property makes min-heaps particularly useful for implementing priority queues and efficient sorting algorithms like heapsort.