Queue data structure | Queue DS | Queue
Queue is a data structure which has these followings characteristics: It has two terminals from where data is insert or get. The process of inserting the data in the queue data structure is called en-queue. (en-queue = insert) The process of getting data from the queue data structure is called de-queue. (de-queue = Get) The FIFO (first in first out) methodology is used in the queue data structure. For getting data from this data structure from one terminal the data is insert and form another terminal data is get. FIFO ( First in first out ) Queue in java Types of Queues thread-safety : if you don't require the queue to be accessed concurrently from multiple threads, then a plain LinkedList can be used as a Queue ; the advantage of the other implementations is that they offer efficient thread-safety; blocking or non-blocking : various blocking implementations add extra methods to put and remove items from the ...