This repository contains my implementations of core Data Structures and Algorithms (DSA) concepts as part of my academic learning and continuous practice.
The goal of this repository is to build a strong understanding of fundamental data structures, algorithm logic, and pointer-based implementations.
- Stack implementation using Linked List
- Push, Pop, Peek, Display operations
- Infix to Postfix conversion
- Queue implementation using Linked List
- Enqueue, Dequeue operations
- Queue traversal and reverse display
- Singly Linked List
- Doubly Linked List
- Insert, Delete, and Traverse operations
- Infix to Postfix conversion
- Operator precedence handling
- Associativity handling
- Bubble Sort
- Selection Sort
- Insertion Sort
- C
- Java (ongoing)
This repository is maintained to:
- Practice and understand DSA concepts
- Strengthen problem-solving skills
- Build a solid foundation in data structures
- Track my learning progress
Harman Singh
GitHub: https://github.com/TheHarmanCodes