Queue | Set 1 (Introduction and Array Implementation)
source link: https://www.geeksforgeeks.org/videos/queue-set-1-introduction-and-array-implementation/
Go to the source link to view the article. You can view the picture content, updated content and better typesetting reading experience. If the link is broken, please click the button below to view the snapshot at that time.
Set 1 (Introduction and Array Implementation)
- 10 Views
- 27/05/2022
Queue is a linear data structure that follows a particular order in which the operations are performed for storing data. The order is First In First Out (FIFO). One can imagine a queue as a line of people waiting to receive something in sequential order which starts from the beginning of the line. It is an ordered list in which insertions are done at one end which is known as the rear and deletions are done from the other end known as the front. A good example of a queue is any queue of consumers for a resource where the consumer that came first is served first. The difference between stacks and queues is in removing. In a stack we remove the item the most recently added; in a queue, we remove the item the least recently added.
Queue _ Set 1 (Introduction and Array Implementation): https://www.geeksforgeeks.org/queue-set-1introduction-and-array-implementation/
Recommend
About Joyk
Aggregate valuable and interesting links.
Joyk means Joy of geeK