Add Min Binary Heap implementation in C

[ABHIRANJAN-KUMAR1]

Description of Change

This Pull Request adds a Min Binary Heap implementation in C under the data_structures/heap directory.

The Min Binary Heap is a tree-based data structure that keeps the smallest element at the root, enabling efficient retrieval of the minimum element in O(1) time.
This implementation supports the following operations: insertion (with heapify-up), extraction of the minimum element (with heapify-down), search (linear), and display of elements in array order. It also includes dynamic memory management and accepts user input for inserting multiple elements.

This contribution is part of Hacktoberfest 2025.

References

• Related discussions: #<issue_number_if_any>
• Similar implementations: max_heap.c in the same directory
• Official contributor guidelines: https://github.com/TheAlgorithms/C/blob/master/CONTRIBUTING.md

Checklist

• Added description of change
• Added file name matches File name guidelines
• Added tests and example, test must pass (You may add tests later if needed)
• Relevant documentation/comments is changed or added
• PR title follows semantic commit guidelines
• Search previous suggestions before making a new one, as yours may be a duplicate.
• I acknowledge that all my contributions will be made under the project's license.

Notes:
Added user-input driven Min Binary Heap implementation in C for efficient minimum element retrieval and heap operations.