What additional operations can be performed on a Doubly Linked List compared to a Singly Linked List?a)Deleting at the end only.b)Searching for an element.c)Traversing in both directions.d)Inserting at the beginning only

In comparison to a Singly Linked List, a Doubly Linked List allows for the following additional operations:

a) Deleting at the end: While this operation can be performed in both types of lists, it is more efficient in a Doubly Linked List. In a Singly Linked List, you would need to traverse the entire list to get to the end, making it an O(n) operation. In a Doubly Linked List, you can access the end directly if you have a pointer to the tail, making it an O(1) operation.

b) Searching for an element: This operation can be performed in both types of lists. However, in a Doubly Linked List, you have the option to search from either the beginning or the end, which could potentially halve the search time in certain scenarios.

c) Traversing in both directions: This is a unique feature of Doubly Linked Lists. In a Singly Linked List, you can only traverse in one direction - from the head to the tail. In a Doubly Linked List, you can traverse in both directions - from the head to the tail and vice versa.

d) Inserting at the beginning: This operation can be performed in both types of lists. However, similar to deletion, it is more efficient in a Doubly Linked List if you maintain a pointer to the head of the list.