{"id":648,"date":"2021-06-21T13:06:52","date_gmt":"2021-06-21T13:06:52","guid":{"rendered":"https:\/\/rahulshettyacademy.com\/blog\/index.php\/2021\/06\/21\/queue-in-java\/"},"modified":"2021-06-21T13:06:52","modified_gmt":"2021-06-21T13:06:52","slug":"queue-in-java","status":"publish","type":"post","link":"https:\/\/rahulshettyacademy.com\/blog\/index.php\/2021\/06\/21\/queue-in-java\/","title":{"rendered":"Queue in Java"},"content":{"rendered":"

<\/p>\n

\n

\n

\n

\n

<\/div>\n

\n

\n

<\/div>\n<\/div>\n

<\/div>\n

\n

<\/div>\n

\n

\n

table of contents<\/div>\n<\/p><\/div>\n<\/div>\n<\/div>\n

\n

\n

<\/div>\n

\n

\n

\n

What is Queue interface and what are the characteristics of Queue in JAVA?<\/a><\/div>\n

How to add element to a Queue?<\/a><\/div>\n

How do we remove element from a Queue?<\/a><\/div>\n

How do we find head element of a queue?<\/a><\/div>\n

How to iterate all elements of a Queue?<\/a><\/div>\n<\/div>\n

<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n

What is Queue interface and what are the characteristics of Queue in JAVA?<\/h3>\n
Queue in JAVA Collection framework is an interface, which extends Collection interface. It is part of java.util package. It is used to store objects to be processed in FIFO order (First In First Out). <\/p>\n
Since Queue is an interface, needs a concrete class for the declaration and the most common classes are the PriorityQueue and LinkedList.<\/p>\n
\n

\n<\/ins>\n<\/div>\n
How to add element to a Queue?<\/h3>\n
There are 2 methods we can use to add element to a Queue, add() and offer(). The methods differ in how the behave if the Queue is full, so no more elements can be added. The add() method throws an exception in that case, whereas the offer() method just returns false.<\/p>\n
Example \u2013<\/strong><\/p>\n<\/div>\n
\n
<\/div>\n
\n
\n
import java.util.;<\/p>\n
public class Main {<\/p>\n
public static void main(String[] args) {
Queue<String> queue = new LinkedList<>();<\/p>\n
queue.add(“element 1”);
queue.offer(“element 2”);<\/p>\n
}
}<\/p>\n<\/div>\n<\/div>\n<\/div>\n
\n
How do we remove element from a Queue?<\/h3>\n
There are 2 methods which can be used to remove elements from a Queue. They are remove() and poll(). <\/p>\n
Both removes the first element of the Queue and returns the removed element. If the Queue is empty, remove() throws an exception while poll() returns null. <\/p>\n
Example<\/strong><\/p>\n<\/div>\n
\n
<\/div>\n
\n
\n
public class Main {<\/p>\n
public static void main(String[] args) {
Queue<String> queue = new LinkedList<>();<\/p>\n
queue.add(“element 1”);
queue.offer(“element 2”);
String e1 = queue.remove();
String e2 = queue.poll();<\/p>\n
System.out.println(e1);
System.out.println(e2);<\/p>\n
}
}<\/p>\n
Output<\/p>\n
element 1
element 2<\/span><\/p>\n<\/div>\n<\/div>\n<\/div>\n
\n
Explanation<\/strong><\/p>\n
The remove() method removes the first element which is \u2018element 1\u2019 and poll() method removes the second element which is \u2018element 2\u2019.<\/p>\n
Observe that FIFO rule is followed here.<\/p>\n
How do we find head element of a queue?<\/h3>\n
We can find the head element of the Queue using element() or peek() methods, without removing the elements.<\/p>\n
\u00a0If the queue is non-empty, both returns the elements. Otherwise, element() throws exception and peek() returns null. <\/p>\n
Example<\/strong><\/p>\n<\/div>\n
\n
<\/div>\n
\n
\n
import java.util.;<\/p>\n
public class Main {<\/p>\n
public static void main(String[] args) {
Queue<String> queue = new LinkedList<>();<\/p>\n
\/\/ Add elements to the queue
queue.add(“element 1”);
queue.offer(“element 2”);
\/\/ Find the head
String e1 = queue.element();
\/\/ Remove the head
queue.poll();
\/\/ Find the head
String e2 = queue.peek();
\/\/ Remove the head
queue.poll();
\/\/ Find the head for empty queue
String e3 = queue.peek();<\/p>\n
System.out.println(e1);
System.out.println(e2);
System.out.println(e3);<\/p>\n
}
}<\/p>\n
Output<\/p>\n
element 1
element 2
null<\/span><\/p>\n<\/div>\n<\/div>\n<\/div>\n
\n
How to iterate all elements of a Queue?<\/h3>\n
We can use Iterator to iterate all elements of a Queue. One important thing to note is, if the implementation of Queue is LinkedList, after iterating, the elements will be returned based on insertion order (default behavior of LinkedList class) but if PriorityQueue implementation is used, the output will be in sorted order. <\/p>\n
Let\u2019s see the difference using 2 examples. <\/p>\n
Example 1 \u2013 LinkedList<\/strong><\/p>\n<\/div>\n
\n
<\/div>\n
\n
\n
import java.util.;<\/p>\n
public class Main {<\/p>\n
public static void main(String[] args) {
Queue<String> queue = new LinkedList<>();<\/p>\n
\/\/ Add elements to the queue
queue.offer(“element 4”);
queue.offer(“element 5”);
queue.add(“element 1”);
queue.offer(“element 2”);
queue.offer(“element 3”);<\/p>\n
Iterator<String> itr = queue.iterator();
while(itr.hasNext())
{
System.out.println(itr.next());
}<\/p>\n
}
}<\/p>\n
Output (Maintains the insertion order)<\/p>\n
element 4
element 5
element 1
element 2
element 3<\/span><\/p>\n<\/div>\n<\/div>\n<\/div>\n
\n
Example 2 \u2013 PriorityQueue<\/strong><\/p>\n<\/div>\n
\n
<\/div>\n
\n
\n
import java.util.;<\/p>\n
public class Main {<\/p>\n
public static void main(String[] args) {
Queue<String> queue = new PriorityQueue<>();<\/p>\n
\/\/ Add elements to the queue
queue.offer(“element 4”);
queue.offer(“element 5”);
queue.add(“element 1”);
queue.offer(“element 2”);
queue.offer(“element 3”);<\/p>\n
Iterator<String> itr = queue.iterator();
while(itr.hasNext())
{
System.out.println(itr.next());
}<\/p>\n
}
}<\/p>\n
Output (Elements are returned in sorted way)<\/p>\n
element 1
element 2
element 4
element 5
element 3<\/span><\/p>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n
<\/div>\n<\/section>\n
<\/body><\/html><\/p>\n","protected":false},"excerpt":{"rendered":"
table of contents What is Queue interface and what are the characteristics of Queue in JAVA? How to add element to a Queue? How do we remove element from a Queue? How do we find head element of a queue? How to iterate all elements of a Queue? What is Queue interface and what are […]<\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[5],"tags":[],"class_list":["post-648","post","type-post","status-publish","format-standard","hentry","category-java","post-wrapper","thrv_wrapper"],"_links":{"self":[{"href":"https:\/\/rahulshettyacademy.com\/blog\/index.php\/wp-json\/wp\/v2\/posts\/648","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/rahulshettyacademy.com\/blog\/index.php\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/rahulshettyacademy.com\/blog\/index.php\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/rahulshettyacademy.com\/blog\/index.php\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/rahulshettyacademy.com\/blog\/index.php\/wp-json\/wp\/v2\/comments?post=648"}],"version-history":[{"count":0,"href":"https:\/\/rahulshettyacademy.com\/blog\/index.php\/wp-json\/wp\/v2\/posts\/648\/revisions"}],"wp:attachment":[{"href":"https:\/\/rahulshettyacademy.com\/blog\/index.php\/wp-json\/wp\/v2\/media?parent=648"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/rahulshettyacademy.com\/blog\/index.php\/wp-json\/wp\/v2\/categories?post=648"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/rahulshettyacademy.com\/blog\/index.php\/wp-json\/wp\/v2\/tags?post=648"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}