Doubly linked list is a complex type of linked list in which a node contains a pointer to the previous as well as the next node in the sequence. Therefore, in a doubly linked list, a node consists of three parts: node data, pointer to the next node in sequence (next pointer) , pointer to the previous node (previous pointer).
Time complexity:
- Insertion At Start,End: O(1)
- Insertion At Middle: O(n)
- Deletion At Start,End : O(1)
- Deletion At Middle: O(n)
- Search: O(n)
- Traversal: O(n)