if there are no nodes in linked list then start pointer will point at which value?

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.
• 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 _________ for a linked list is a pointer variable that locates the beginning of the list.
• How do you calculate the pointer difference in a memory efficient double linked list?
• A _____________ list is a list where the last node contains null pointer.
• To insert element at start, the previous pointer of newly added node would point to ______
• The situation when in a linked list START=NULL is
• The situation in linked list START = NULL is called_________
• The situation when in a linked list START=NULL is ….
• The concatenation of two list can performed in O(1) time. Which of the following variation of linked list can be used?