problem 1) prepare a program to implement single linked list of integers and perform the following operations
• add the integer in beginning
• add the integer after the given element in the list
• add the integer before the given element in the list
• add the integer at the position given by the user.
• add the integer at end
• display the list
• delete the element from the beginning
• delete the element from the end
• delete the element from specified position.
• delete the element given by the user.
• Search the item in the list.
problem 2) prepare a program to implement a circular linked list of integers.
problem 3) prepare a program to implement linked stack .
problem 4) prepare a program to implement a linked queue.
problem 5) prepare a program to implement a linked circular Queue.
problem 6) prepare a program to implement a linked dequeue.
problem 7) prepare a program to create two linked lists of integers in ascending order and merge both the lists to create a new list in ascending order.
problem 8) prepare a program to reverse a linked list.
problem 9) prepare a program to check that the given linked list of integers is sorted in ascending order or not.
problem 10) prepare a program to split the linked list into two linked lists, so that each list gets equal number of nodes. (Delete a node if required).