Queues

Queue data structure java tutorial example explained #queue #data #structure // ******************************************************* // Queue = FIFO data structure. First-In First-Out // A collection designed for holding elements prior to processing // Linear data structure // enqueue = offer() // dequeue = poll() // Where are queues useful? // 1. Keyboard Buffer (letters should appear on the screen in the order they're pressed) // 2. Printer Queue (Print jobs should be completed in order) // 3. Used in LinkedLists, PriorityQueues, Breadth-first search // *******************************************************