This project is a a dedicated repository for PCC-CS391, also known as Data Structures and Algorithms. This repository is a treasure trove of knowledge, encompassing a vast array of codebases that delve into both linear and non-linear data structures.
It houses a collection of codebases covering both linear and non-linear data structures, encompassing essential concepts such as stacks, queues, linked lists, graphs, and trees and their various applications.The repository serves as a centralized resource for students and enthusiasts to access and explore a diverse range of problems and implementations related to this crucial field of computer science.
All the codebases are written in C/C++
Contributions are what make the open source community such an amazing place to be learn, inspire, and create. Any contributions you make are greatly appreciated.
- If you have suggestions for adding or removing projects, feel free to open an issue to discuss it, or directly create a pull request after you edit the README.md file with necessary changes.
- Please make sure you check your spelling and grammar.
- Create individual PR for each suggestion.
- Fork the Project
- Create your Feature Branch (
git checkout -b feature/NewFeature
) - Commit your Changes (
git commit -m 'Add some NewFeature'
) - Push to the Branch (
git push origin feature/NewFeature
) - Open a Pull Request
- Rohan Mitra - Computer Science Student - Github