Data Structures and Algorithms

This repository contains implementations of various data structures and algorithms in Python.

Implemented So far:

1. Sorting Algorithms

   • Bubble Sort
   • Merge Sort
   • Heap Sort
   • Insertion Sort
   • Selection Sort
   • Radix Sort
   • Quick Sort
   • Bucket Sort
   • Counting Sort
   • Shell Sort

2. Stack

   • Implementation of a Stack data structure.

3. Queue

   • Implementation of a Queue data structure.

4. Linked List

   • Singly Linked List
   • Doubly Linked List

5. Tree

   • Binary Tre
   • Tree Traversal Algorithms (Inorder, Preorder, Postorder)

6. Graph

   • Adjacency matrix and implementation
   • DFS (depth first search)
   • BFS (breadth first search)

7. Searching Algorithms

   • Linear Search
   • Binary Search
   • Jump Search
   • Interpolation Search

Upcoming Implementations:

1. Arrays

   • Dynamic Arrays
   • Static Arrays
   • ...

2. Heap

   • Min-Heap
   • Max-Heap
   • ...

Usage

Each directory in this repository contains the Python implementation of the respective data structure or algorithm. You can explore each implementation and use it as per your requirements.

Contributions

Contributions are welcome! If you'd like to add a new data structure or algorithm, please feel free to create a pull request.

License

This repository is licensed under the MIT License.