This repository contains manual implementations of common Data Structures in Java.
It was built as part of a Data Structures and Algorithms (DSA) project in the 3rd semester.
The purpose is to understand how data structures work internally and to improve OOP concepts.
- ArrayList
- LinkedList (Simple)
- Doubly LinkedList
- Circular LinkedList
- Stack
- Queue using ArrayList
- Queue using LinkedList
- Queue using Stack
- Priority Queue using Min Heap
- Priority Queue using Max Heap
- Binary Search Tree
- Binary Heap
- Language: Java
- Paradigm: Object-Oriented Programming (OOP)
- Focus: Understanding internal working of DS and algorithms
- Improved problem-solving skills
- Better understanding of how collections work behind the scenes
- Strong foundation for algorithms and system design