In a doubly linked list, what is the space complexity for storing both the next and previous nodes in each node where there are ‘n’ nodes in the list?

The space complexity for storing both the next and previous nodes in each node of a doubly linked list with 'n' nodes is O(n).

Here's the step-by-step explanation:

1. In a doubly linked list, each node contains three fields: one for the data and two for the addresses of the next and previous nodes.

2. The space required for the data field depends on the type and size of the data being stored. However, the space required for the next and previous fields is constant for each node, regardless of the number of nodes in the list.

3. Therefore, if there are 'n' nodes in the list, the total space required for the next and previous fields is proportional to 'n'.

4. Hence, the space complexity for storing both the next and previous nodes in each node of a doubly linked list is O(n).