Answer to Question #240690 in C++ for jan

Question

Explain in your own words the Analysis of Linked List operations (add,remove,find,back).

Answer 1

(i). Add is a linked list operation to add a node at a given position in the list. A node can be added at the head, at the end or after a given node.

(ii). Remove is to delete a node from a linked list. The steps of deleting the node are: Find the previous node of the node to be deleted, change the next pointer of the previous node then free the memory of the deleted node.

(iii). Find is to search an elements by value. To find an element, we can transverse the linked list and compares the value present in the node.

(iv). Back is to reverse the elements in a linked list.