Lesson 7 - Queue and Stack in Java
In the previous lesson, Dictionaries (maps) and sets in Java, we introduced dictionaries and sets. Today's tutorial is dedicated to two special collections: queues and stacks. We're going to explain how these collections work and create examples in Java for each one of them. The queue and the stack are used in rather advanced algorithms, but every programmer should know them and know how to use them when it's convenient.
Queue (generally as FIFO, meaning First In First Out) refers to a collection that has two basic methods. These methods are an analogy for adding and removing methods from other collections. The method for adding an element adds it to the end of the queue, just like when you're waiting in line at the post office. The removal method always removes the first element of the queue, i.e. the one who's about to be served, not the one that was last added. Keep in mind that the element is returned by the method before being deleted from the queue. Meaning that the collection allows us to
...End of the preview...
You've come here and that's great! We believe that the first lessons showed you something new and useful
Do you want to continue the course? Go to the premium section.
- Unlimited and permanent access to individual lessons.
- High quality IT knowledge.
- Skills to help you get your dream and well-paid job.
Requested article covers this content:
In this Java tutorial, we'll explain the Queue interface and the Stack class and other implementations of these collections on examples.
You gain credits by supporting our network. This is done by sending a helpful amount of money to support the site, or by creating content for the network.