The situation when in a linked list START=NULL is

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.
• The situation in linked list START = NULL is called_________
• The situation when in a linked list START=NULL is ….
• 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?
• A linked list whose last node points back to the list node instead of containing the null pointer________.
• The _________ for a linked list is a pointer variable that locates the beginning of the list.
• A _________is a linked list which always contains a special node called the header node, at the beginning of the list.
• Each node in a linked list has two pairs of ………….. and ……………….
• A circular linked list can be used for