Min Heap is a data structure that is used extensively in various operations like sorting, job scheduling and various other operations. A binary min heap is a min heap, with each node having atmost two children. Various operations like insertion, deletion and traversal are possible on a min heap, and their C code is provided in this repository.

To learn more about min heap, have a look at: A Study In Min Heap