Explain insertion and deletion on a linked list.

Insertion to the head of the head or tail of a list is trivial. For example to insert to the head of the list we create a new head node and make it point to the previous head node. Insertion to other parts of the list in some order requires some sort of searching to find the correct node. The same goes for deletion of a node.