Which data structure allows deleting data elements from front and inserting at rear?

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 ?
• What is the space complexity for deleting a linked list?
• The worst case complexity of deleting any arbitrary node value element from heap is
• If we implement heap as min-heap, deleting root node (value 1)from the heap. What would be the value of root node after second iteration if leaf node (value 100) is chosen to replace the root at start.
• Which of the following data structure is linear data structure?
• Identify the data structure which allows deletions at both ends of the list but insertion at only one end___________.
• In a circular queue, how do you increment the rear end of the queue?
• Which of the following is true while inserting a new node in the list?
• A data structure in which elements can be inserted or deleted at/from both the ends but not in the middle is?
• To represent hierarchical relationship between elements, which data structure is suitable?