Advanced Data Structures in Python

Implementation of core data structures and algorithms in Python, organized into classes, applications, and tests.

Structure

Code/
├── Classes/        # Data structure implementations
├── Apps/           # Real-world usage examples
└── Tests/          # Unit tests (65 tests)

Structures

Structure	Operations
AVL Tree	Insert, delete, search — O(log n)
Min/Max Heap	Push, pop, heapify — O(log n)
Hash Table	Get, set, delete — O(1) avg
Skip List	Insert, delete, range query — O(log n)
Bloom Filter	Add, contains — O(k)
Graph	BFS, DFS, Dijkstra, Bellman-Ford, Kruskal, Prim, Topological Sort
Trie	Insert, search, autocomplete — O(L)
LRU Cache	Get, put — O(1)

Setup

cd Code
python -m unittest discover Tests/

Run Apps

python -m Apps.task_scheduler
python -m Apps.social_network
python -m Apps.autocomplete_engine
python -m Apps.route_planner

Requirements

pip install mmh3 bitarray  # Bloom Filter only