A ……………….. is a linear list in which insertions and deletions are made to from either end of the structure.

Related MCQs

• A ……………….. is a linear list in which insertions and deletions are made to from either end of the structure.
• Identify the data structure which allows deletions at both ends of the list but insertion at only one end.
• Identify the data structure which allows deletions at both ends of the list but insertion at only one end.
• Identify the data structure which allows deletions at both ends of the list but insertion at only one end___________.
• 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.
• A linear list of elements in which deletion can be done from one end (front) and insertion can take place only at the other end (rear) is known as a ?
• 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 data structure where elements can be added or removed at either end but not in the middle is called …
• A data structure where elements can be added or removed at either end but not in the middle is called …
• Which of the following data structure is not linear data structure?