[FEATURE]Add Binary Heap Algorithm (Min Heap) in C #1496
Description
Detailed description
### PROPOSAL
Add a Min Binary Heap implementation in C (under Binary tree in c folder) — a tree-based data structure that keeps the smallest element at the root, ensuring efficient retrieval in constant time.
The implementation supports key heap operations such as insertion, extraction, search, and display, with proper memory management and clear documentation.
⚙️ Features
Insert: Adds an element while maintaining the heap property (heapify-up).
Extract Min: Removes and returns the smallest element (heapify-down).
Search: Linear search for a given value.
Display: Prints all elements in array order.
Dynamic memory management to avoid leaks.
⏱️ Time Complexity
Insert: O(log n)
Extract Min: O(log n)
Search: O(n)
Get Min (Peek): O(1)
Display: O(n)
Context
Please assign this to me as I want to contribute under Hacktoberfest2025.
Possible implementation
Below is the implementation of Min Binary heap in C :
Additional information
No response