Operations on linked list ADT:

Linked list is a type of data structure that holds nodes linked to each other, where every node consists of information and reference parts.

Linked list allows many operations on it. The following list displays some of the possible operations.

· Creating a list: It involves allocating memory and reading data for the nodes and linking them as per Polynomial addition the mechanism

· Destroying a list: It involves deallocating memory for all the nodes of a linked list.

· Counting the length the list: Length of the node is counting number of nodes in the linked list

· Finding k^th element in the list: It returns the element at the given position

· Searching for an element in the list: It returns the position of the element if the searching element exists otherwise an error indicating value.

· Concatenating two lists: Appending two different linked lists to form a single list.

· Inserting an element in the list: Inserting a new node in the linked list at a given position or after a value.

· Deleting an element in the list: Deleting an existing node in the linked list at a given position or given value.

· Printing the list: Displaying all the elements of the list