What is the temporal complexity of obtaining the last element in a doubly linked list?

In a doubly linked list, accessing the last element typically has a time complexity of O(1) if the list has a reference to the tail node. If such a reference is not available, then the entire list must be traversed, resulting in a complexity of O(n). In standard implementations of doubly linked lists, a pointer to the last element is usually stored, making access to it fast.