DATA STRUCTURE II

DATA STRUCTURES LABORATORY

Group A (to be implemented in C++ programming)

1. Create binary tree and perform recursive and non-recursive traversals

2. Create binary tree. Find height of the tree and print leaf nodes. Find mirror image, print original and mirror image using level-wise printing

3. Create in-order threaded binary tree and perform traversals

4. Represent graph using adjacency list and perform DFS and BFS

5. Represent graph using adjacency list or matrix and generate minimum spanning tree using Prism’s algorithm

6. Implementation of B tree

7. Implementation of AVL tree

8. Implementation of direct access file using different collision resolution techniques

Group B (to be implemented in C++ and compare with STL implementation)

1. Implementation of SLL , DLL and CLL

               SLL

               CLL

               DLL

2. Implementation of stack & queue using SLL

               STACK

               QUEUE

3. Write a program to add binary numbers (assume one bit as one number) Use STL stack.

4. Implement Dqueue (Double ended queue) using STL.

5. Use STL for Sorting and searching with user-defined records such as Person Record (Name, birth date, telephone no), item record (item code, item name, quantity and cost)