The following is two-way list

Related MCQs

• 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
• 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
• A variation of linked list is circular linked list, in which the last node in the list points to first node of the list. One problem with this type of list is?
• 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
• A _______ list structure can be traversed in two directions-- in the forward direction from beginning of the list to end, or in the backward direction, from the end of the list to the beginning.
• _________ header list combines the advantages of a two-way list and a circular header list.
• A variant of linked list in which last node of the list points to the first node of the list is?
• Which of the following operations is performed more efficiently by doubly linked list than by singly linked list?
• The concatenation of two list can performed in O(1) time. Which of the following variation of linked list can be used?
• To find the predecessor, it is required to traverse the list from the first node in case of singly linked list.