Answer:
two
Explanation:
A linked list is a data structure which stores the multiple-element with data type
and a pointer that stores the address of the next element.
A linked list is a series of nodes connecting each other by a pointer.
a node contains data and a pointer.
For build an array, two pointers are used:
the first pointer for specifies the starting node called head node.
and the second pointer is used to connect the other node to build the linked list.
Both are used to build the array if we lose the head node we cannot apply the operation because we do not know the starting node and we cannot traverse the whole linked list.
for example:
1->2->3->4->5
here, 1 is the head node and -> denote the link which makes by the second pointer.
