Simple Linked List

Insertion Operation

Adding a new node in linked list is a more than one step activity. We shall learn this with diagrams here.

First, create a node using the same structure and find the location where it has to be inserted.
second,Imagine that we are inserting a node B (NewNode), between A (LeftNode) and C (RightNode). Then point B.next to C.
third, the next node at the left should point to the new node.

Deletion is also a more than one step process. We shall learn with pictorial representation.

First, locate the target node to be removed, by using searching algorithms.
Second,The left (previous) node of the target node now should point to the next node of the target node.
Third,we will remove what the target node is pointing at.

We need to make the last node to be pointed by the head node and reverse the whole linked list.

First, we traverse to the end of the list. It should be pointing to NULL. Now, we shall make it point to its previous node.
Second,We have to make sure that the last node is not the last node. So we’ll have some temp node, which looks like the head node pointing to the last node. Now, we shall make all left side nodes point to their previous nodes one by one.
Third,Except the node (first node) pointed by the head node, all nodes should point to their predecessor, making them their new successor. The first node will point to NULL.
Fourth,We’ll make the head node point to the new first node by using the temp node.