Introduction to singly Link List:

There are various linked list data structure in computer science which are used to store data. the data is grouped with the address of next data and this group identity is called node in linked list.

For example : let we are having a set of {2,3,4} integers. Now linked list representation will be like below:



The above figure show the singly linked list.

Implementation of singly linked list in C

To implement the singly linked list we have to make a data node which will hold the data and address.