What data structures are implemented in the LinkedList class?

The LinkedList class in Java implements a doubly linked list. This data structure consists of elements (nodes) that contain references to both the next and previous elements.

Features:

• Fast addition and removal of elements at the beginning and end of the list.
• Supports insertion and deletion operations in the middle of the list without shifting other elements.

Example usage:

LinkedList<String> list = new LinkedList<>();
list.add("First");
list.addLast("Last");
list.addFirst("New first");