Which type of linked list allows traversal in both forward and backward directions?Singly linked listDoubly linked listCircular linked listStack

Answer:

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

Explanation:

1. Singly Linked List: In this structure, each node contains data and a reference (or a pointer) to the next node. Traversal is only possible in one direction (forward).

2. Doubly Linked List: This type of linked list contains nodes that have two references, one pointing to the next node and another pointing to the previous node. This enables traversal in both forward and backward directions.

3. Circular Linked List: While it can be singly or doubly linked, the defining characteristic is that the last node points back to the first node, creating a circular traversal in one or two directions depending on whether it's singly or doubly linked.

4. Stack: A stack is not a linked list; it's a data structure that follows the Last In, First Out (LIFO) principle and allows insertion and deletion of elements at one end only.

Thus, the correct answer is: Doubly linked list.