Algorithm for insert a node at the beginning of the singly linked list

1.  Allocate memory for the new node.

2.  Assign a value to the data field of the new node.

3.  Make the next field of the new node point to START  

 (that is the first node in the list).

4.  Make START point to the new node.