A data structure in which elements may be added to or deleted from the front or the rear is called a

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
• Which data structure allows deleting of data elements from front and insertion at rear?
• Which data structure allows deleting data elements from front and inserting at rear?
• Which data structure allows deleting data elements from front and inserting at rear ends?
• Which of the following is a data structure in which insertion and deletion takes place at both the ends?
• Which of the following data structures supports insertion or deletion of elements either from the front (he...
• Which of the following data structures is a special type of data structure in which insertions and deletion...