What is the time complexity of operations in a doubly linked list?

The time complexity of operations in a doubly linked list is O(1) for insertion and deletion at the beginning or end of the list, and O(n) for insertion and deletion in the middle of the list.