To know more about a singly linked list, click on the link given below:Īs the name suggests, the doubly linked list contains two pointers. In the above representation, we have defined a user-defined structure named a node containing two members, the first one is data of integer type, and the other one is the pointer (next) of the node type. Representation of the node in a singly linked list In this list, only forward traversal is possible we cannot traverse in the backward direction as it has only one link in the list. The linked list, which is shown in the above diagram, is known as a singly linked list as it contains only a single link. The pointer that holds the address of the initial node is known as a head pointer. The first node contains the address of the next node, i.e., 200, the second node contains the address of the last node, i.e., 300, and the third node contains the NULL value in its address part as it does not point to any node. We can observe in the above figure that there are three different nodes having address 100, 200 and 300 respectively. The representation of three nodes as a linked list is shown in the below figure: Suppose we have three nodes, and the addresses of these three nodes are 100, 200 and 300 respectively. The address part in a node is also known as a pointer. The singly linked list is a data structure that contains two parts, i.e., one is the data part, and the other one is the address part, which contains the address of the next or the successor node.

If we are talking about the linked list, it means it is a singly linked list. It is the commonly used linked list in programs. The following are the types of linked list: So, to know about the linked list, click on the link given below: Types of Linked list Before knowing about the types of a linked list, we should know what is linked list.