SET 1
1. Implement a program for Linear Search
2. Implement a program for Linked List - Insert Node
at the Tail
3. Implement a program for Binary Tree creation
SET 2
1. Implement a program for Binary Search
2. Implement a program for Queue Operations –
Enqueue, Dequeue and Print.
3. Implement a program for construct a binary search
tree and find the height of the tree.
SET 3
1. Implement a program for Selection Sort
2. Implement a program for binary tree inorder
traversal sequence.
3. Implement a program for AVL tree insertion.
SET 4
1. Implement a program for Insertion Sort
2. Implement a program to construct and print the
right view of binary search tree.
3. Implement a program for Breadth First Search
algorithm for Graph datastructure.