Linked list(3)

In Linked list implementation, a node carries information regarding _______.

A linked list in which the last node of Linked list points to the first is called a _________.

A doubly linked list performs traversal in _________.

Linked list data structure usage offers considerable saving in

Which of the following operation is performed more efficiently in doubly linked list ?

If in a linked list address of first node is 1020 then what will be the address of node at 5th position ?

In Circular Linked List insertion of a node involves the modification of ____ links.

The link field in the last node of the singly linked list contains _________.

When new element is added in the middle of singly linked list then ________.

If a list contains no elements it is said to be