Have you heard of Queue in data structure? A Queue is a linear structure that follows a particular order in which the operations are performed. Queues provide services in computer science, transport, and operations research where various entities such as data, objects, persons, or events are stored and held to be processed later. In these contexts, the queue performs the function of a buffer. Queues are based on the FIFO principle, i.e., the element inserted at the first, is the first element to come out of the list. The basic queue operations are enqueued (insertion) and dequeue(deletion). Enqueue is done at the front of the queue and dequeue is done at the end of the queue. The elements in a queue are arranged sequentially and hence queues are said to be linear data structures. The queue is used when things don't have to be processed immediately, but have to be processed in First In First Out order like Breadth-First Search. The advantages of queues are that the multiple data can be handled, and they are fast and flexible. Disadvantages of queues: To include a new element in the queue, the other elements must be deleted.

Gokul Pradeep

119 resources

0

0

0

Like