Question

Which data structure allows deleting data elements from front and inserting at rear

Answer 1

Queue allows insertion of data elements from rear and deletion from front.

Answer 2

Queue

Explanation:

A queue is an ordered series of objects wherein the addition of recent objects takes place at one end, known as the “rear,” and the elimination of current objects happens at the opposite end, normally known as the “front.”

As a detail enters the queue it begins off evolved on the rear and makes its manner closer to the front, ready till that point when .

A series of objects wherein most effective the earliest introduced object can be accessed.

Delete returns the object removed.