Data Structures Lab

---

 LIST OF EXPERIMENTS:

1. Perform Linear Search and Binary Search on an array.
2. Program to implement a Stack using an array.
3. Create a stack and perform Pop, Push operations on the stack using a Linear Linked list.
4. Program to implement Queue using an array.
5. Create a Linear Queue using Linked List and implement different operations such as insert, delete, and display the queue elements.
6. Implement sparse matrices using arrays.
7. Implement the following sorting techniques:
• Insertion sort
• Merge sort
• Bubble sort
• Selection sort
• Quick sort
8. Create a linked list with nodes having information about a student. Insert a new node at the specified position.
9. Create a doubly linked list with nodes having information about an employee and perform Insertion at front of doubly linked list and perform deletion at end of that doubly linked list.
10. Create a circular linked list having information about a college and perform Insertion at the front end and perform deletion at the end.
11. Program to implement BFS and DFS Traversal of a graph. 
12. Create a Binary Tree and perform Tree Traversals (Preorder, Postorder, Inorder) using the concept of recursion.
13. Implement insertion, deletion, and display (Inorder, Preorder, Postorder) on binary search tree with the information in the tree about the details of an automobile (type, company, year of make).

---