This list consists of a number of nodes in which each node has a next pointer to the following element. The link of the last node in the list is NULL, which indicates the end of the list.
2. Doubly linked list:
It is a two-way linked list. A user can navigate in both directions. In a doubly linked list, the user can delete a node even if he doesn’t have the previous node’s address.
3. Circular linked list:
In singly linked lists and doubly linked lists, the end of lists is indicated with a NULL value. But circular linked lists do not have ends. In circular linked lists, each node has a successor and last node points to the first node instead of NULL.