Yes, LinkedList is a doubly linked list, as the Javadoc mentions :
Doubly-linked list implementation of the List and Deque interfaces. Implements all optional list operations, and permits all elements (including null).
All of the operations perform as could be expected for a doubly-linked list. Operations that index into the list will traverse the list from the beginning or the end, whichever is closer to the specified index.
What's missing in java LinkedList is ability to store pointers. Consider the following code:
var list = new LinkedList<Integer>();
var head = list.listIterator();
var anotherHead = list.listIterator();
anotherHead.add(5);
System.out.println(head.next());
We would like to store a pointer to the head and use it later. No way. As soon as the list gets modified (through other pointer for example) our pointer becomes invalid. In a normal linked list the old pointer should still allow us to navigate through the list.