Welcome to the DSA in Java repository!
This project provides simple and clear Java implementations of common Data Structures and Algorithms.
It's especially crafted for beginners looking to understand core DSA concepts and improve their problem-solving skills.
- Beginner-friendly Java code examples
- Covers a wide range of DSA topics
- Well-commented implementations
- Modular structure for easy navigation
- Basic Operations (Insert, Delete, Traverse)
- Sorting Algorithms:
Bubble Sort,Selection Sort,Merge Sort, etc.
- Singly Linked List
- Doubly Linked List
- Basic Operations: Insertions, Deletions, Traversals
- Stack using Arrays and Linked Lists
- Queue and Circular Queue implementations
- Applications in expression evaluation and more
- Binary Tree & Binary Search Tree (BST)
- Tree Traversals: Preorder, Inorder, Postorder
- Graph Representations: Adjacency Matrix & List
- Depth-First Search (DFS)
- Breadth-First Search (BFS)
- Bubble Sort
- Selection Sort
- Merge Sort
- Quick Sort
- Linear Search
- Binary Search (Iterative & Recursive)
- Java (JDK 8+)
- No external libraries required
https://github.com/deepakshroff/HitBulleye_Lab.git
cd dsa-java