Why does LinkedList implement the List and Deque interfaces?

LinkedList is a doubly linked list that maintains the order of element addition. It implements:

• List: Provides standard list operations (adding, removing, accessing by index), although index access is O(n) unlike ArrayList's O(1).
• Deque: Provides operations for adding and removing elements from both ends (front and back) of the list in O(1) time.

This makes LinkedList a versatile data structure suitable for working with lists, queues, or stacks.