Queues
•
We can think of stacks as having only one
end; because, all operations are performed at
the top of the stack.
–
That is why we call it a Last in -- First out data
structure.
•
A queue, on the other hand, has two ends:
a
front and a rear (or tail).
