What is the expected access time to a node located in the middle of a linked list?

In a linked list, access to a node in the middle requires sequential traversal from the beginning of the list to the desired element. This means that the access time to a node in the middle of the list is O(n), where n is the number of elements before this node. Unlike an array, where index access is O(1), a linked list does not allow quick access to an arbitrary element without traversing through the previous ones.