A data structure in which elements can be inserted or deleted at/from both the ends but not in the middle is?

Related Questions

• New data are to be inserted into a data structure, but there is no available space; this situation is usually called__________.
• Identify the data structure which allows deletions at both ends of the list but insertion at only one end___________.
• If the elements “A”, “B”, “C” and “D” are placed in a queue and are deleted one at a time, in what order will they be removed?
• If the elements A, B, C and D are placed in a stack and are deleted one at a time, what is the order of removal?
• When elements are deleted the nodes go to_________.
• Which data structure allows deleting data elements from front and inserting at rear?
• Which of the following data structure is linear data structure?
• To represent hierarchical relationship between elements, which data structure is suitable?
• The OS of a computer may periodically collect all the deleted space onto the free storage list. This technique is called______________.
• An array consists of n elements. We want to create a heap using the elements. The time complexity of building a heap will be in order of