The type of linear data structure 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
Reveal answer
Fill a bubble to check yourself
Keep practicing — related questions
- In which data structure can the insertion and deletion of elements be done only from one end?
- Which of the following data structures is a special type of data structure in which insertions and deletion...
- Which data structure allows deleting data elements from front and inserting at rear ends?
- A linear list in which elements can be added or removed at either end, but not in the middle is called
- Which of the following data structures represents an ordered list in which insertion and deletion both occu...
- Which data structure allows deleting data elements from front and inserting at rear?
- Which data structure allows deleting of data elements from front and insertion at rear?
- Identify the data structure which allows deletions at both ends of the list but insertion at only one end.