Solution

Each node is having a successor node in a Linked List.

• In a linked list, every node contains data and a pointer (or reference) to its successor node (the next node in the sequence).

• The last node points to NULL (in a singly linked list) or back to the head (in a circular linked list).