June 2018
Intermediate to advanced
316 pages
6h 34m
English
A queue represents the first in, first out (FIFO) principle. This means that after an element is added, it can be removed only after removing all other elements that were added before it. Unlike the stack data structure, you can manipulate items from both ends of a queue. A queue supports two operations—Enqueue, to insert element at the end and Dequeue, to remove it:

Read now
Unlock full access