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

Related MCQs

• 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 a linked list the _________field contains the address of next element in the 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 ?
• Base address is the address of __________.
• What differentiates a circular linked list from a normal linked list?
• What differentiates a circular linked list from a normal linked list?
• Consider a small circular linked list. How to detect the presence of cycles in this list effectively?
• What would be the asymptotic time complexity to add a node at the end of singly linked list, if the pointer is initially pointing to the head of the list?
• The concatenation of two list can performed in O(1) time. Which of the following variation of linked list can be used?