A queue is a First In First Out data structure that saves the elements in an array
such that elements are added from one end (head) and removed from the other end
(tail). For example, if user saves elements ‘2’, ‘9’, ‘10’, ‘8’ one by one the queue will
return ‘2’, ‘9’, ‘10’ and ‘8’ one by one when required.
- Storage of 10 integers ranging from (0)10 to (15)10.
- Insert element in queue, if queue is already full then inform the user.
- Remove element from queue, if queue is empty then inform the user.
Dear None, your question requires a lot of work, which neither of our experts is ready to perform for free. We advise you to convert it to a fully qualified order and we will try to help you. Please click the link below to proceed: Submit order