A …………………… does not keep track of address of every element in the list.

Related Questions

• Which of the following statement is true?i) Using singly linked lists and circular list, it is not possible to traverse the list backwards.ii) To find the predecessor, it is required to traverse the list from the first node in case of singly linked list.
• In ……………, search start at the beginning of the list and check every element in the list.
• If in a linked list address of first node is 1020 then what will be the address of node at 5th position ?
• What differentiates a circular linked list from a normal linked list?
• There is an extra element at the head of the list called a ……….
• The operation of processing each element in the list is known as
• The operation of processing each element in the list is known as ……
• What happens when the stack is full and there is no space for a new element, and an attempt is made to push a new element?
• Which of the following is not a type of Linked List ?
• Identify the data structure which allows deletions at both ends of the list but insertion at only one end.