Identify the data structure which allows deletions at both ends of the list but insertion at only one end.

Related MCQs

• 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___________.
• A ……………….. is a linear list in which insertions and deletions are made to from either end of the structure.
• A ……………….. is a linear list in which insertions and deletions are made to from either end of the structure.
• 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 ?
• A data structure in which elements can be inserted or deleted at/from both the ends but not in the middle is?
• 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.
• Which data structure allows deleting data elements from and inserting at rear?
• Which data structure allows deleting data elements from front and inserting at rear?
• Which data structure allows deleting data elements from front and inserting at rear?