Question

the element are inserted in a queue from the end called
​

Answer 1

Explanation:

Queue is also an abstract data type or a linear data structure, just like stack data structure, in which the first element is inserted from one end called the REAR(also called tail), and the removal of existing element takes place from the other end called as FRONT(also called head).

$\bold\purple{♡}{\red{\underline{\pink{\mathbf{Hope \: it's \: helpful \: for \: you .}}}}}\bold\blue{♡}$

Answer 2

Answer:

Queue is also an abstract data type or a linear data structure, just like stack data structure, in which the first element is inserted from one end called the REAR(also called tail), and the removal of existing element takes place from the other end called as FRONT(also called head).