Question

Which type of linked list provides bidirectional traversing
​

Answer 1

To delete a node in singly linked list, the previous node is required, while in doubly linked list, we can get the previous node using previous pointer. It is very convenient than singly linked list. Doubly linked list maintains the links for bidirectional traversing.

Answer 2

• doubly linked list

Any node of a doubly linked list, once obtained, can be used to begin a new traversal of the list, in either direction (towards beginning or end), from the given node. The link fields of a doubly linked list node are often called next and previous or forward and backward.