A data structure where elements can be added or removed at either end but not in the middle is called …

Related MCQs

• A data structure where elements can be added or removed at either end but not in the middle is called …
• A data structure in which elements can be inserted or deleted at/from both the ends but not in the middle is?
• 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 ?
• ……………. Is a pile in which items are added at one end and removed from the other.
• Which of the following data structure can’t store the non-homogeneous data elements?
• Which of the following data structure can’t store the non-homogeneous data elements?
• A ……………….. is a linear list in which insertions and deletions are made to from either end of the structure.
• A ……………….. is a linear list in which insertions and deletions are made to from either end of the structure.
• Identify the data structure which allows deletions at both ends of the list but insertion at only one end.
• Identify the data structure which allows deletions at both ends of the list but insertion at only one end.