In doubly linked lists, traversal can be performed?

Related MCQs

• Consider an implementation of unsorted doubly linked list. Suppose it has its representation with a head pointer and tail pointer. Given the representation, which of the following operation can be implemented in O(1) time? i) Insertion at the front of the linked list ii) Insertion at the end of the linked list iii) Deletion of the front node of the linked list iv) Deletion of the end node of the linked list
• Consider an implementation of unsorted singly linked list. Suppose it has its representation with a head and tail pointer. Given the representation, which of the following operation can be implemented in O(1) time? i) Insertion at the front of the linked list ii) Insertion at the end of the linked list iii) Deletion of the front node of the linked list iv) Deletion of the last node of the linked lis
• Consider an implementation of unsorted singly linked list. Suppose it has its representation with a head pointer only. Given the representation, which of the following operation can be implemented in O(1) time? i) Insertion at the front of the linked list ii) Insertion at the end of the linked list iii) Deletion of the front node of the linked list iv) Deletion of the last node of the linked list
• Which of the following operations is performed more efficiently by doubly linked list than by singly linked list?
• The post order traversal of a binary tree is DEBFCA. Find out the pre order traversal
• A node of doubly linked contains
• The concatenation of two list can performed in O(1) time. Which of the following variation of linked list can be used?
• Linked lists are not suitable to for the implementation of?
• Linked lists are best suited for
• A ________ linked list is a linked list structure in which each node has a pointer to both its successor and predecessor.