Introduction - If you have any usage issues, please Google them yourself
CS2208 - Data Structures Lab (Anna University)
EXERCISES
1a. Implement singly linked lists.
1b. Implement doubly linked lists.
2. Represent a polynomial as a linked list and write functions for polynomial addition.
3. Implement stack and use it to convert infix to postfix expression
4. Implement a double-ended queue (dequeue) where insertion and deletion operations are possible at both the ends.
5. Implement an expression tree. Produce its pre-order, in-order, and postorder traversals.
6. Implement binary search tree.
7. Implement insertion in AVL trees.
8. Implement priority queue using binary heaps
9. Implement hashing with open addressing.
10. Implement Prim s algorithm using priority queues to find MST of an undirected graph.