Answer TRUE or FALSE.
In a singly linked list implementation, to access the predecessor of the current node we must start at the first node in the list.
In a singly linked list we are unable to move directly backwards in the list.
So, the only alternative is to start at the front and move down to the previous node.