This repository contains my implementations of core data structures built from scratch as part of my coursework and personal practice. Each project is implemented without using built-in collection classes, focusing on understanding the inner workings, efficiency, and object-oriented design principles.
The goal of this repository is to showcase my understanding of fundamental data structures and algorithms. Each implementation includes test cases to demonstrate correctness and, in some cases, performance comparisons. This project is continuously updated as I learn new techniques and data structures.
| Data Structure | Description | Folder |
|---|---|---|
| Set | Custom Set implementation supporting add, remove, and membership operations | /sets |
| Stack | Resizable array and linked list implementations | /stacks |
| Queue | FIFO queue using array and linked list | /queues |
| Linked List | Singly and doubly linked lists | /linked-lists |
| Tree | Binary search tree implementation | /trees |
| Graph | Graph with adjacency list representation | /graphs |
- Implemented
Setclass from scratch without using built-in libraries. - Supports operations:
add(),remove(),contains(). - Includes test cases demonstrating correctness and efficiency.
(Add similar highlights for other DS projects you feel are strong.)