Which of the following is false about a doubly linked 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.
• What is the worst case time complexity of inserting a node in a doubly linked list?
• Minimum number of fields in each node of a doubly linked list is____
• In doubly linked lists
• In doubly linked lists, traversal can be performed?
• The concatenation of two list can performed in O(1) time. Which of the following variation of linked list can be used?
• Which of the following is false about a circular linked list?
• A _________is a linked list which always contains a special node called the header node, at the beginning of the 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?
• A linked list whose last node points back to the list node instead of containing the null pointer________.