problem 1) prepare a program to concatenate two linked lists.
problem 2) prepare a program to convert singly linked list into circular linked list.
problem 3) prepare a program to create single linked list of integers, where the new node has to be inserted in such a way that the list is always sorted in ascending order.
problem 4) prepare a program to count the maximum, minimum, sum, average and count of the values stored in the linked list of integers.
problem 5) X points to the first node of the singly linked list. Search the first occurrence of ITEM in the list and split the list into two, so that y points to the sublist beginning with ITEM.
problem 6) prepare a program that creates a linked list of characters from a string entered by the user. Your program is then to remove a number of consecutive elements from the linked list(in effect removing a sub-string from the string entered). This is to be achieved by the user entering two integers. The first of which will represent an index (counting from zero) into the linked list, and the second will represent the number of elements to be removed. For ex, if the user enters the following string (without the quotes):
"I do not love C"
and then enters the two integers 2 and 7, the program will output (without the quotes):
"I love C"
Your program is to use only one linked list.
problem 7) prepare a program to sort linked list of integers using insertion sort technique.
problem 8) prepare a program to implement the doubly linked list and implement the following functions:
• add the node in beginning
• add the node after the given element in the list
• add the node before the given element in the list
• add the node at the position given by the user.
• add the node 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 an item in the list.