- 📏 Linear Structures
- Dynamic Queues, Stacks, Lists, and Sequences ensuring
$O(1)$ complexity for core insertion and deletion operations.
- Dynamic Queues, Stacks, Lists, and Sequences ensuring
- 🪴 Tree Structures
- Dynamic Binary Trees and Binary Search Trees (BST).
- Includes advanced recursive algorithms for depth, height, and boundary calculations in
$O(n)$ time.
- ⚡ Heaps & Priority Queues
- Min-Heaps implemented with implicit arrays, optimizing insertion and extraction to
$O(\log n)$ .
- Min-Heaps implemented with implicit arrays, optimizing insertion and extraction to
- 📖 Dictionaries & Hash Tables
- Open and Closed Addressing Hash Tables, plus Ordered Tables for associative mapping and fast lookups.
To demonstrate the practical utility of these ADTs, several applied programs are included in the src/examples/ directory:
- 🏥 Hospital Triage: Priority-based patient queue management using Heaps.
- 🎸 Fan Club Manager: Combining Hash Tables for constant-time lookups and Priority Queues for dynamic ranking.
- 🔍 Cross-Reference Engine: Text parsing and analysis using Ordered Tables and Sequences.