Singly Linked List : Simple C program to insert an element at the beginning and visualise the node.

A linked list is a data structure that maintains linearity. It consists of nodes. In addition to the data, each node also contains a pointer to the next node in the list. If the next node pointer is NULL that signifies that node is the last node of the linked list. Most importantly, a linked list also uses a pointer which is called the head pointer that points to the first node of the list. If the head pointer points to NULL then it means the list is empty.
In this lecture, I have demonstrated a complete C program which bits by bits explains the insertion technique of a node at the beginning of a linked list and then how to display the linked list!

The basic concept of the Singly Linked List has been covered in the earlier lecture(below link).

C programming for Singly Linked List,Insertion of a node at the beginning of Singly Liked List,Data Structures and Algorithms,