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 ? Data Structures 3 May 20203 May 2020StudyBlocksLeave a Comment on 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 ? a) Queue b) Stackc) Treed) Linked list