mirror of
https://github.com/TheAlgorithms/C.git
synced 2026-02-04 05:44:35 +00:00
[PR #1529] [CLOSED] Add Min Binary Heap implementation in C #2138
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?
📋 Pull Request Information
Original PR: https://github.com/TheAlgorithms/C/pull/1529
Author: @ABHIRANJAN-KUMAR1
Created: 11/14/2025
Status: ❌ Closed
Base:
master← Head:min-binary-heap📝 Commits (1)
096b376Add Min Binary Heap implementation📊 Changes
1 file changed (+134 additions, -0 deletions)
View changed files
➕
data_structures/heap/MinBinaryHeap.c(+134 -0)📄 Description
Description of Change
This Pull Request adds a Min Binary Heap implementation in C under the
data_structures/heapdirectory.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
Checklist
Notes:
Added user-input driven Min Binary Heap implementation in C for efficient minimum element retrieval and heap operations.
🔄 This issue represents a GitHub Pull Request. It cannot be merged through Gitea due to API limitations.