Does the data structure list support traversal in both directions or only in one?

In Java, the LinkedList data structure implements a doubly linked list, which allows traversal of elements both forwards and backwards. This is achieved because each element contains references to the next and previous nodes. Unlike a singly linked list, where movement is only forward, a doubly linked list is convenient for operations requiring reverse traversal or deletion of elements from both ends.