A _________is a linked list which always contains a special node called the header node, at the beginning of the list.

Related MCQs

• A ______________ list is a header list where the node points back to the header node.
• 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 points back to the header node.
• A linked list whose last node points back to the list node instead of containing the null pointer________.
• __________________ is a header list where the last node contains the null pointer.
• The _________ for a linked list is a pointer variable that locates the beginning of the list.
• 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 ___________.
• 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?
• A _____________ list is a list where the last node contains null pointer.