A linear list in which elements can be added or removed at either end but not in the middle is known as
Reveal answer
Fill a bubble to check yourself
Keep practicing — related questions
- A data structure where elements can be added or removed at either end but not in the middle
- A data structure where elements can be added or removed at either end but not in the middle
- The type of linear data structure in which deletion can be done from one end (front) and insertion can take...
- A data structure in which elements may be added to or deleted from the front or the rear is called a
- Elements can be added and removed from the either end in ____?
- Which of the following is not a type of linear data structure?
- In which of the following data structures, the elements cannot be inserted into the middle of the list or d...
- In which data structure can the insertion and deletion of elements be done only from one end?