Data Structures and Algorithms
This repository contains my solutions to various Data Structures and Algorithms (DSA) questions related to heaps. Heaps are a fundamental data structure in computer science, characterized by their tree-based structure where the parent node is either greater than (in a max heap) or less than (in a min heap) its child nodes. I am using the Coder Army Sheet for these questions here.
In this repository, you'll find solutions to a variety of heap-related DSA questions. Each solution is implemented in the C++ programming language and organized into separate directories for easy navigation.
- Clone this repository to your local machine:
git clone <repository-url>
- Navigate to the directory containing the solution you're interested in.
- Open the file in your preferred code editor to view the solution.
- Run the solution using an appropriate compiler or interpreter for the chosen programming language.
Contributions to this repository are welcome! If you'd like to contribute a new solution, fix a bug, or improve an existing solution, feel free to open a pull request. Please adhere to the existing code style and ensure that your solution is well-documented.
This repository is licensed under the MIT License.