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

Related Questions

• 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 data structure allows deleting data elements from front and inserting at rear?
• 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?
• How many pointers are necessarily changed for the insertion in a Linked List?
• Which of the following data structure is linear data structure?
• New data are to be inserted into a data structure, but there is no available space; this situation is usually called__________.
• In linked list each node contain minimum of two fields. One field is data field to store the data second field is?
• The concatenation of two list can performed in O(1) time. Which of the following variation of linked list can be used?
• A _________is a linked list which always contains a special node called the header node, at the beginning of the list.