Program List -1
Program List -1
Write a program for a singly linked list to insert, display, delete, search, and count (at a
desired position) using a switch statement.
2. Write a program for the linked list representation of a polynomial and its addition.
3. Write a program to create a circular linked list to perform insertion, display, delete,
search, and count using a switch statement.
4. Write a program to create a doubly linked list stack.
5. Write a program to show push and pop operations in a stack.
6. Write a program for the linked list implementation of a stack.
7. Write a program for the conversion of infix notation to postfix notation.
8. Write a program to calculate the factorial of a number using recursion.
9. Write a program to calculate the factorial of a number using both recursive and non-
recursive functions.
10. Write a program to create a queue to perform insert, display, delete, search, and count
using a switch statement.
11. Write a program for the linked list implementation of a queue.
12. Write a program for the linked list implementation of a priority queue.
13. Write a program to insert an element in a circular queue.
14. Write a program to insert an element in a double-ended queue.
15. Write a program for linear search.
16. Write a program for binary search.
17. Write a program to implement binary search using recursion.
18. Write a program for bubble sort.
19. Write a program for selection sort.
20. Write a program for insertion sort.
21. Write a program for radix sort.
22. Write a program for merge sort.
23. Write a program for quick sort.
24. Write an iterative program to search for a key in a Binary Search Tree (BST).
25. Write a program for recursive traversal in a BST (Preorder, Postorder, and Inorder).
26. Write a program to search for the largest element in a BST and count the number of
nodes.
27. Write a program to represent a graph using Breadth-First Search (BFS).
28. Write a program to represent a graph using Depth-First Search (DFS).
29. Write a program to find the minimum spanning tree using Kruskal's or Prim's algorithm.