mirror of
https://github.com/TheAlgorithms/C.git
synced 2026-02-04 05:44:35 +00:00
[FEATURE]Add Binary Heap Algorithm (Min Heap) in C #199
Reference in New Issue
Block a user
Delete Branch "%!s()"
Deleting a branch is permanent. Although the deleted branch may continue to exist for a short time before it actually gets removed, it CANNOT be undone in most cases. Continue?
Originally created by @mad-alpha on GitHub (Oct 4, 2025).
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 :
Min Binary Heap.c
Additional information
No response
@crackedmob commented on GitHub (Oct 8, 2025):
Please assign this to me as I want to contribute under Hacktoberfest2025.
@Vadank-Ji commented on GitHub (Oct 10, 2025):
I would love to work on this as a part of Hacktoberfest2025 and later as well.
I already good knowledge on trees and would like to further extend it by working on this!
@nayanashaji commented on GitHub (Oct 29, 2025):
Is this still available? I am new to this...
@Vadank-Ji commented on GitHub (Oct 29, 2025):
@nayanashaji You haven't been assigned but you can put in a pull request and if they find it good it will be included!
@nayanashaji commented on GitHub (Oct 29, 2025):
ok thank you!
@github-actions[bot] commented on GitHub (Nov 29, 2025):
This issue has been automatically marked as abandoned because it has not had recent activity. It will be closed if no further activity occurs. Thank you for your contributions.
@github-actions[bot] commented on GitHub (Dec 7, 2025):
Please ping one of the maintainers once you add more information and updates here. If this is not the case and you need some help, feel free to ask for help in our Gitter channel or our Discord server. Thank you for your contributions!