The operation of processing each element in the list is known as

Related MCQs

• The operation of processing each element in the list is known as ……
• 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.
• In ……………, search start at the beginning of the list and check every element in 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?
• The concatenation of two list can performed in O(1) time. Which of the following variation of linked list can be used?
• A _____________ list is a list where the last node contains null pointer.
• 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.
• The advantage of a two-way list and a circular header list is combined into a ________.