Answer TRUE or FALSE.
In a doubly linked list implementation, to access the predecessor of the current node we must start at the first node in the list.
The key difference between the singly and doubly linked list impleentations is that the doubly linked list can easily reach the previous node.