Projects

• Project 1: Stack Implementation - A simple stack with push, pop, and display functionality.
• Project 2: Queue Simulation - A queue simulating a ticket counter with enqueue and dequeue.
• Project 3: Linked List Operations - A singly linked list with insertion, deletion, and traversal methods.
• Project 4: Binary Search Tree (BST) - A BST with insert, delete, and search methods.
• Project 5: Graph Representation - A graph using an adjacency list, with DFS and BFS traversal.
• Project 6: Hash Table - A simple hash table with insert, delete, and search, including collision handling.