This project provides an implementation of a min-heap data structure in C#. A min-heap is a binary tree-based data structure that maintains the minimum value at the root. It supports efficient operations such as insertion, extraction of the minimum element, and updating the heap.
To use this project, follow these steps:
- Clone the repository:
git clone https://github.com/Ilia-Abolhasani/min-heap.git-
Open the solution file (
Data Sructure.sln) in your preferred IDE. -
Build the solution to compile the code.
Contributions to this project are welcome. If you encounter any issues or have suggestions for improvements, please open an issue on the GitHub repository.
This project is licensed under the MIT License.