- Perform String operations with and without pointers
2. Implement Database Management using an array of structures.
3. Implement Stack and Queue using arrays.
4. Evaluate postfix expression.
Evaluation of Postfix Expression
5. Create a singly linked list.
6. Implement stack and queue using a linked list.
7. Perform the addition of two polynomials using a linked list.
Polynomial addition
8. Implement a Circular Linked List.
Circular Linked List
9. Implement a Binary search tree.
10. Implement Graph using adjacency Matrix with BFS & DFS traversal
WeGrow12330 