Which type of linked list allows traversal in both forward and backward directions?a.Singly linked listb.Circular linked listc.Linear linked listd.Doubly linked listClear my choice

The type of linked list that allows traversal in both forward and backward directions is a Doubly linked list.

Here's a step-by-step explanation:

1. Singly linked list: This type of linked list allows traversal in only one direction, from the head node to the last node.

2. Circular linked list: This type of linked list is a variation of a singly linked list, but the last node points back to the first node, creating a circle. It still only allows traversal in one direction.

3. Linear linked list: This is another name for a singly linked list, so it also only allows traversal in one direction.

4. Doubly linked list: This type of linked list has two references, one to the next node and another to the previous node. Therefore, it allows traversal in both forward and backward directions.

So, the answer is d. Doubly linked list.