A linked list allows sequential access, but not random access.
To find the list element in position n, we must begin at the head
of the list and move sequentially through positions 1, 2, ..., n - 1
before reaching position n.
Sequential access is much slower than random access if the list elements are
accessed randomly.
Sequential access may be faster than random access if the list elements are
accessed sequentially.
Technique of chasing pointers to locate position pos
LinkedListNode* node = head;
for (int i = 1; i < pos; i++)
node = node->next;
