_______________is a header list where the last node points back to the header node.

Related MCQs

• A ______________ list is a header list where the node points back to the header node.
• A linked list whose last node points back to the list node instead of containing the null pointer________.
• A _________is a linked list which always contains a special node called the header node, at the beginning of the list.
• 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.
• __________________ is a header list where the last node contains the null pointer.
• A _____________ list is a list where the last node contains null pointer.
• The advantage of a two-way list and a circular header list is combined into a ________.
• If we implement heap as min-heap, deleting root node (value 1)from the heap. What would be the value of root node after second iteration if leaf node (value 100) is chosen to replace the root at start.
• If in a linked list address of first node is 1020 then what will be the address of node at 5th position ?
• To insert a new node in linked list free node will be available in ___________.