A linked list is represented by a pointer to the first node of the linked list.
The first node is called a head. If the linked list is empty, then the value of head is NULL.
Each node in a list consists of at least two parts:
- Pointer to the next node