![\"\"](\"https:\/\/prepbytes-misc-images.s3.ap-south-1.amazonaws.com\/assets\/1664152172461-Topic.jpg\")
<\/p>\n<\/p>\n
Data structure refers to a collection of data with well-defined operationsIn this article, we\u2019ll be discussing Data structures in Java, The term data, behaviour, or properties. A data structure is a special manner of storing or organising data in computer memory so that we can use it effectively.
\nSo, in this article, we are going to discuss 2 very important data structures viz, Queue and Heap (Priority Queue).<\/p>\n
Data Structures in Java are an important part of Programming. Get a better understanding of problems by watching these video tutorials<\/a> created by expert mentors at Prepbytes<\/a>.<\/p>\n Let us first talk about the queue data structure in Java. <\/p>\n As shown in the image above, a queue is a linear data structure that can be imagined as if it is open from both ends. The ends of a queue are called front and rear. A Queue is a FIFO<\/strong> data structure. <\/p>\n This means that it follows the FIFO principle for the insertion and removal of elements. FIFO stands for First in First out<\/strong>. So, the element that is entered first into the queue will be the first element to be removed from the queue as well.<\/p>\n A queue is an Interface in Java. This means that it can be implemented via multiple classes. So, if we create a reference to Queue, we can create the object of a Linked List, ArrayDeque, PriorityQueue, etc.<\/p>\n However, the functionality of queue data structure is best provided by ArrayDeque. So, we mostly use ArrayDeque Class to create a Queue object if we require the functionalities of a queue only. <\/p>\n A program to create a queue is shown below.<\/p>\n\t\t\t\t\t\tQueue in Java<\/h2>\n
![\"\"](\"https:\/\/prepbytes-misc-images.s3.ap-south-1.amazonaws.com\/assets\/1664151155316-1-01.png\")
<\/p>\nCreating a Queue:<\/h3>\n