All the nodes in a singly linked list are arranged sequentially by linking with a pointer. A singly linked list can grow or shrink, because it is a dynamic data structure. Following figure explains the different operations on a singly linked list. Illustrate, please see example below.
Create a NODE with DATA(30).
1. Insert a node with DATA(40) at the end
2. Insert a node with DATA(10) at the beginning
3. Insert a node with DATA(20) at the 2nd position
4. Insert a node with DATA(50) at the end
Output 10, 20, 30, 40, 50