It is also called One Way List or Singly Linked List. It is linear collection of data elements which are called ‘Nodes’. The elements may or may not be stored in consecutive memory locations. So pointers are used maintain linear order.
Each node is divided into two parts. The first part contains the information of the element and is called ‘INFO Field’. The second part contains the address of the next node and is called ‘LINK Field’ or ‘NEXT Pointer Field’. The START contains the starting address of the linked list i.e. it contains the address of the first node of the linked list. The LINK Field of last node contains NULL Value which indicates that it is the end of linked list. It is shown below: