CS1243: DATA STRUCTURES LAB

Part A
 Linked list: traversal, node deletion, node insertion in singly, doubly and circular lists
 Implementation of different searching techniques
 Implementation of different sorting techniques
Part B
 Stacks: matrix representation and linked list representation: Push, Pop
 Queues: matrix representation and linked list representation: Add, delete
 Circular queue implementation
 Evaluation of expression using stacks
 Tree traversal
 Evaluation of expression using binary trees.
 Infix to postfix and prefix conversion
 Creating and processing binary search tree