Underlying data structure of LinkedList Class implementing collections interface in java is Linear or Doubly?

List<String> list = new LinkedList();

This "list" is created in java. As we know , every class in Collections framework has some underlying data structure. LinkedList in java has Linear LinkedList implementation or Doubly LinkedList implementation as its underlying Data structure?

>Solution :

According to the documentation LinkedList is an implementation of the Doubly-linked list data structure:

All of the operations perform as could be expected for a doubly-linked list.