A comprehensive repository implementing various Data Structures and Algorithms with practical applications. This collection is ideal for learning, revision, and applying core DSA concepts in real-world scenarios.
- Dynamic Array
- Singly Linked List
- Doubly Linked List
- Circular Linked List
- Multi-Linked List
- Static Stack
- Dynamic Stack
- Static Queue
- Dynamic Queue
- Priority Queue
- Hash Table (Linear Probing)
- Hash Table (Open Hashing / Separate Chaining)
- Heap (Tree Implementation)
- Binary Search Tree (BST)
- AVL Tree
- Routing Table (Trie Tree)
- Graph (Adjacency List)
- Graph (Adjacency Matrix)
- Bubble Sort
- Insertion Sort
- Selection Sort
- Merge Sort
- Quick Sort
- Infix to Postfix Conversion
- Infix to Prefix Conversion
- Postfix Expression Evaluation
- Prefix Expression Evaluation
- Expression Tree Construction
- Kruskal's Algorithm
- Prim's Algorithm
You can explore each data structure and algorithm by navigating to its respective folder or file. The implementations are written with clarity to serve both learning and practical purposes.
Feel free to fork the repo, add improvements, fix bugs, or contribute new data structures and algorithms. Pull requests are welcome!
Special thanks to the community and academic resources that contributed to the development of this comprehensive DSA collection.