Answer:
False
Explanation:
Linkedlist is a data structure which is used to store the elements in the node.
The node has two store two data.
first element and second pointer which store the address of the next node.
if their is no next node then it store the NULL.
We can store data in randomly. Therefore, the order of node cannot be determine by data values.
we can use pointers for traversing using the loop because only pointer know the address of the next node, and next noe know the address of next to next node and so on...
Therefore, the answer is False.
