Welcome to the Non-Linear Data Structures and Algorithms repository. This repository contains my documented practice and solutions for various data structure and algorithm problems from platforms like LeetCode, Coding Ninjas, and Geeks for Geeks, with a focus on non-linear data structures.
- Comprehensive Solutions: Includes solutions to a variety of problems from popular coding platforms.
- Focused Study: Emphasizes non-linear data structures such as trees, graphs, heaps, and more.
- Diverse Techniques: Demonstrates different algorithms and problem-solving techniques.
To get a local copy up and running, follow these simple steps.
Ensure you have the following installed on your local machine:
- Git
- A C++ compiler (like GCC or Clang)
-
Clone the repository:
git clone https://github.com/yashthakur16/Non-Linear-Data-Structures-and-Algorithms.git cd Non-Linear-Data-Structures-and-Algorithms
Navigate through the directory to find solutions to specific problems. Each file is named according to the problem it solves.
Boundary Traversal.cpp: Solution for performing boundary traversal of a binary tree.Dijkstra's algorithm.cpp: Implementation of Dijkstra's algorithm for finding the shortest path in a graph.
Contributions are what make the open-source community such an amazing place to learn, inspire, and create. Any contributions you make are greatly appreciated.
If you have a suggestion that would make this better, please fork the repository and create a pull request. You can also simply open an issue with the tag "enhancement".
- Fork the Project
- Create your Feature Branch (
git checkout -b feature/AmazingFeature) - Commit your Changes (
git commit -m 'Add some better approach') - Push to the Branch (
git push origin feature/AmazingFeature) - Open a Pull Request
Yash Thakur(tyash6843@gmail.com)
Project Link: https://github.com/yashthakur16/Non-Linear-Data-Structures-and-Algorithms