Project 1: Stack Implementation

Created a simple stack data structure with push, pop, and display functionality.

View Code

Project 2: Queue Simulation

Developed a queue data structure simulating a ticket counter with enqueue and dequeue operations.

View Code

Project 3: Linked List Operations

Built a singly linked list with insertion, deletion, and traversal methods, including reversal functionality.

View Code

Project 4: Binary Search Tree (BST)

Implemented a BST with insert, delete, and search methods, as well as in-order traversal.

View Code

Project 5: Graph Representation

Developed a graph using an adjacency list, with depth-first search (DFS) and breadth-first search (BFS) traversal methods.

View Code

Project 6: B-Tree Implementation

Implemented a B-Tree with insertion, deletion, and search functionality for balanced data structure representation.

View Code