This repository contains various Data Structures and Algorithms (DSA) implementations and exercises. The purpose of this repository is to document and practice DSA concepts.
This repository includes implementations of fundamental data structures and algorithms, along with several coding problems and their solutions. The goal is to provide a comprehensive guide for learning and practicing DSA.
- Graph representation using adjacency list
- Depth First Search (DFS)
- Breadth First Search (BFS)
- Finding the depth of a node
- Finding the height of a tree
- Binary Search Tree (BST)
- Tree Traversals (In-order, Pre-order, Post-order)
- Depth of a node
- Height of a tree
- Trie implementation for string storage and search
- Insertion and search operations
- Binary Heaps
- Heap operations (insertion, deletion, heapify)
- Building a heap from an array
- Bubble Sort
- Insertion Sort
- Merge Sort
- Quick Sort
- Selection Sort
- Binary Search
- Depth First Search (DFS)
- Breadth First Search (BFS)
- Stack operations
- Queue operations
To use the code in this repository, clone it using the following command:
Clone the project:
git clone https://github.com/kishankumar07/dataStructuresAndAlgorithms.gitNavigate to the repository directory:
cd dataStructuresAndAlgorithms
You can run the code files directly using Node.js:
node filename.js
Make sure to have Node.js installed on your machine. You can download it from Node.js.
Contributions are welcome! If you have any suggestions, improvements, or new algorithms to add, feel free to open a pull request.
- Fork the repository
- Create your feature branch (git checkout -b feature/YourFeature)
- Commit your changes (git commit -m 'Add some feature')
- Push to the branch (git push origin feature/YourFeature)
- Open a pull request
This project is licensed under the MIT License - see the LicenseFile for details.