🧠 Data Structures in Python

This repository contains implementations of classic data structures in Python, including lists, stacks, queues, trees, and graphs.
It's designed as a personal reference and educational toolkit, with clean modular code and unit tests for each structure.

⚙️ Built from scratch without external libraries — focused on core logic and algorithmic clarity.

---

📦 Project Structure

data_structures/
├── graphs/
│   ├── directed_graph.py
│   └── flow_network.py
├── lists/
│   ├── single_linked_list.py
│   └── doubly_linked_list.py
├── stacks_and_queues/
│   ├── stack.py
│   ├── queue.py
│   └── deque.py
└── trees/
    ├── binary_tree.py
    └── binary_search_tree.py

tests/
├── test_lists/
├── tests_stacks_and_queues/
├── tests_trees/
└── tests_graphs/

Each folder has its corresponding test suite under the /tests directory, organized by category.

---

✅ Implemented Structures

Category	Structures
Lists	Singly Linked List, Doubly Linked List
Stacks & Queues	Stack (LIFO), Queue (FIFO), Deque
Trees	Binary Tree, Binary Search Tree
Graphs	Directed Graph, Flow Network

---

🧪 Testing

All data structures include basic unit tests under the /tests directory.
To run all tests:

python -m unittest discover tests

Make sure you're in the project root before running this command.

🚧 Future Additions

This project is under active development. Planned additions include:

✅ AVL Trees / Red-Black Trees

✅ Heaps (Min/Max)

✅ Tries

✅ Disjoint Sets

✅ Graph algorithms (BFS, DFS, Dijkstra, Prim, Kruskal)

🙋‍♂️ About Me

Angel Gael Aviles Gama
LinkedIn
GitHub