Physics, asked by akshatkaushik930, 1 year ago

How to implement the Queues? Explain

Answers

Answered by Anonymous
0
Queue arranges element in such a way that new element always gets added in the back and also when comes the removal it removes the last or oldest element or which is the first element in the queue. It is also known as FIFO or First In First Out.

thanks
Similar questions