This repository contains implementations of common data structures using Java. The projects are created for learning, practice, and understanding how data structures work internally.
- Stack
- Queue (using Singly Linked List)
- Singly Linked List (with and without tail)
- Doubly Linked List
- Binary Search Tree (BST)
- Graph
- Array-based implementations
src/ ├── Stack/ ├── Queue/ ├── SLL/ ├── DLL/ ├── BST/ ├── Graph/ └── ArrayWithShifting
- Nodes and pointers
- Head and tail references
- Traversal techniques
- Insert and delete operations
- Time complexity basics
- Java
This repository is intended for educational purposes and serves as a personal practice and portfolio of data structure implementations.
Each data structure is implemented in its own folder to keep the code organized and easy to understand.