Data Structures and Algorithms in Python

About this Repository

This repository serves as an educational resource for learning and implementing data structures and algorithms using Python. It contains a broad collection of data structures, each implemented with a focus on educational utility.

Data Structures

Below are some of the key data structures covered in this repository:

Linked Lists

• Supports adding, removing, and traversing through nodes.
  • Singly Linked List
  • Doubly Linked List
  • Node

Stacks

• A LIFO (Last-In, First-Out) data structure that efficiently handles push and pop operations.
  • Stack

Queues

• A FIFO (First-In, First-Out) data structure for efficient enqueue and dequeue operations.
  • Queue

Hash Maps

• Implements hash tables with chaining for collision resolution.
  • Hash Map

Trees

• Features various tree data structures with methods for traversal, insertion, and deletion.
  • Tree Node
  • Binary Tree
  • Binary Search Tree

Graphs

• Contains graph data structures and traversal algorithms. Vertex objects serve as the fundamental units for constructing graphs.
  • Graph
  • Vertex

Heaps

• Coming soon.

Algorithms

This section will cover a range of algorithms:

Sorting

• Coming soon.

Searching

• Coming soon.

Recursive

• Coming soon.

Greedy Algorithms

• Coming soon.

Dynamic Programming

• Coming soon.

Graph Algorithms

• Coming soon.

Contributing

To contribute, please follow these steps:

1. Fork the repository.
2. Create a new branch.
3. Make and commit your changes.
4. Push the branch.
5. Create a pull request with details of your changes.

Please update tests as needed and open an issue for any significant changes.

License

This project is licensed under the MIT License. Use, study, and build upon this repository for educational purposes. See the LICENSE file for details.

Happy learning, and enjoy your journey through the world of data structures and algorithms!