About this project

This repository provides minimal, clean, and well-documented implementations of data structures and algorithms in Python 3. Each file is self-contained with docstrings, type hints, and complexity notes — designed to be read and learned from. It includes modules for sorting, searching, graph algorithms, dynamic programming, backtracking, bit manipulation, compression, and more. Data structures such as Binary Heap, Trie, BST, AVL Tree, Red-Black Tree, Union-Find, and Segment Tree are implemented. The code is organized by topic with clear examples for each algorithm, making it suitable for educational use or quick reference. Tests are included for verification. Install via pip install algorithms and import modules directly for immediate use.