Data Structures Laboratory Solved

Description

I . Write a program to perform the following operations usi ng a Singly Linked List:

1. Search for a particu lar element node.

2. Delete from end of the l ist

2. Write program to perform the followi ng operations usi ng a Singly Linked List:

   1. Ordered Insertion

   2. Pri nt the alternate elements i n the l ist

2. Write program to perform the following operations usi ng a Dou bly Linked List

   1. Position Insertion

   2. Position Deletion

2. Im plement Joseph us problem using circular l ist.

Sa. W rite a program to implement convert an Infix expression to a postfix form usi ng stack.

b. W rite a program to com pute the first n fabinocci series using recursion.

6. Write a program perform the following implementation usi ng a stack

1. Postfix evaluation

2. Tower of Hanoi (Recursion)

6. Write a program implement a queue usi ng a l i nked l ist and perform the followi ng operat ions

   1. I nsert rear end

   2. Delete at front end

6. Write a program to construct a Binary Tree using array traverse the tree usi ng inorder & postorder traversal

6. Write a program to construct a Binary Search Tree using Li nked List traverse the tree using preorder traversal. A lso count the n um ber of leaf nodes and com pute the height of the tree.

I 0. Construct a graph and traverse usi ng the BFS- usi ng queues/ DFS-usi ng stack. A lso cou nt the n um ber of components i n the graph.

I I . Construct a M i n Heap Tree using Top Down approach 12 . Construct a Max Heap usi ng Bottom-u p approach

13. Im plement priority queue usi ng heap.

13. Construct a Threaded Binary Tree and traverse usi ng preorder traversal

13. Construct an expression tree for i nfix expression. Also eval uate the expression and traverse the tree usi ng postorder traversal.

13. Im plement the followi ng usi ng Tries:

1. Search a word based on prefix

2. Delete the word

1 7. im plement hashi ng techn iq ue to avoid col l ision usi ng separate chain i ng. 1 8. Im plement hash ing techn ique to avoid col l ision usi ng l inea r probi ng.