Data Structures & Algorithms Exercises 🚀

Welcome to paulpapi's repository for Data Structures and Algorithm Exercises! This collection includes implementations of fundamental and advanced concepts in C++, covering sorting techniques, linked lists, stack & queue operations, trees, and graphs.

📌 Overview

This repository is designed for learning and practicing efficient problem-solving techniques. It contains:

• Advanced Sorting Algorithms – Optimized sorting methods beyond basic techniques.
• Linked Lists – Implementations of singly, doubly, and circular linked lists.
• Stack & Queue – Data structures for LIFO and FIFO operations.
• Trees & Graphs – Algorithms for traversal, searching, and shortest paths.

🔍 Implemented Topics

Sorting Algorithms

• Merge Sort
• Quick Sort
• Heap Sort
• Radix Sort

Linked Lists

• Singly Linked List (Insertion, Deletion, Traversal)
• Doubly Linked List (Forward & Backward Traversal)
• Circular Linked List (Efficient Memory Utilization)

Stack & Queue

• Stack (Push, Pop, Peek, Min Stack)
• Queue (Linear Queue, Circular Queue, Priority Queue)
• Queue using Two Stacks

Tree Algorithms

• Binary Search Tree (BST)
• AVL Trees (Balanced Trees)
• Tree Traversal (Inorder, Preorder, Postorder)
• Huffman Coding Tree

Graph Algorithms

• Depth-First Search (DFS)
• Breadth-First Search (BFS)
• Dijkstra’s Algorithm (Shortest Path)
• Floyd-Warshall Algorithm

💻 Getting Started

Clone this repository:

git clone https://github.com/paulpapi/CS-DSA-Exercises.git
cd CS-DSA-Exercises