Metadata-Version: 2.4
Name: Olaluwoye-data-structures
Version: 0.1.0
Summary: A Python package implementing core data structures from scratch using object-oriented Python
Home-page: https://github.com/olaluwoye9/Olaluwoye-data-structures
Author: Olaluwoye Olalekan
Author-email: olaluwoye9@gmail.com
License: MIT
Classifier: Programming Language :: Python :: 3
Classifier: Programming Language :: Python :: 3.6
Classifier: License :: OSI Approved :: MIT License
Classifier: Operating System :: OS Independent
Requires-Python: >=3.6
Description-Content-Type: text/markdown
License-File: LICENSE
Dynamic: author
Dynamic: author-email
Dynamic: classifier
Dynamic: description
Dynamic: description-content-type
Dynamic: home-page
Dynamic: license
Dynamic: license-file
Dynamic: requires-python
Dynamic: summary

# data-structures-python

A beginner-friendly Python package that implements classic data structures from scratch using **object-oriented Python**. Designed to help learners understand how data structures work under the hood without relying on Python’s built-in abstractions.

Whether you're a coding bootcamp student, computer science learner, or self-taught developer — this package is for you.

---

## Why This Project?

Most learners rely on built-in Python data types (lists, sets, dicts) without truly understanding how they work under the hood.

This package is designed for:
- Beginners who want hands-on experience
- Bootcamp students preparing for interviews
- Anyone transitioning into software engineering or data structures


## 🧠 What’s Inside?

This package provides detailed implementations and clean interfaces for the following data structures:

| Data Structure       | Description |
|----------------------|-------------|
| ✅ **Array**          | Dynamic array with index-based operations |
| ✅ **Stack**          | LIFO stack implemented using both a Python list and a linked list |
| ✅ **Queue**          | FIFO queue implemented using a list |
| ✅ **Linked List**    | Singly linked list with insert, delete, search, and update operations |
| ✅ **Doubly Linked List** | Bi-directional traversal with flexible insert/delete |
| ✅ **Binary Search Tree (BST)** | Recursive insert, search, and in-order traversal |
| ✅ **Graph**          | Undirected graph using an adjacency list |

All implementations are **self-contained**, easy to understand, and extensible for future improvements (e.g., weighted graphs, AVL trees, etc.).

---

data-structures-python/
├── data_structures/         # Core package code
│   ├── array.py
│   ├── stack.py
│   ├── stack_linked.py
│   ├── queue.py
│   ├── linked_list.py
│   ├── doubly_linked_list.py
│   ├── tree.py
│   └── graph.py
├── examples/                # Jupyter notebooks (demos)
│   ├── stack_example.ipynb
│   ├── queue_example.ipynb
│   ├── ...
├── README.md
├── LICENSE
├── setup.py
└── pyproject.toml

---

## 🚀 Installation

Once published on PyPI, install using:

```bash
pip install data-structures-python

---
## Author

Created by [Your Olaluwoye Olalekan Taofeek] — MSc in Statistics and Big Data.

📧 Email: oolaluwoye@aimsammi.org  
🔗 LinkedIn: [linkedin.com/in/olaluwoye-olalekan](linkedin.com/in/olaluwoye-olalekan-612a92147)

---
## Live Documentation

Access the live documentation here:  
👉 [Live Docs - data-structures-python](https://olaluwoye9.github.io/data-structures-python/)

