A queue remember the order of its elements, but only adds at the tail and removes from the head.
<h3>What is a stack?</h3>
A stack can be defined as a collection that is designed and developed to remember the order of its elements, while allowing elements to be added and removed only at one end i.e either head or tail.
<h3>What is a
queue?</h3>
A queue can be defined as a collection that is designed and developed to remember the order of its elements, and it only allow elements to be added (inserted) at one end and removed only at the other end.
In this context, we can infer and logically deduce that, a queue remember the order of its elements, but would only add at the tail while removing from the head.
Read more on queue here: brainly.com/question/24275089
#SPJ1
Complete Question:
A remember the order of its elements, but only adds at the tail and removes from the head
The number or link at the bottom wich says for more infirmation click here
Answer:
whattttttttttttt is thissssss
Sarah wants to find out how much time it would take to drive from her home to New York. At an average, she would drive at 55 miles per hour. If the distance to be covered is 1150 km and a mile equals 1.61 km, how much time will the trip take (to the nearest hour)? O 13 hours 21 hours 29 hours 34 hours
