Queue Introduction 🎯

Welcome to the exciting world of Data Structures and Algorithms! In this lesson, we'll delve into the concept of Queues - a fundamental data structure used in various real-world applications.

What is a Queue? 📝

A Queue is a linear data structure that follows a First-In-First-Out (FIFO) principle. This means that the first element that enters the queue is the first one to leave. Imagine a line at a coffee shop - people join at the back and leave from the front. That's a Queue!

Why Use a Queue? 💡

Queues are essential in managing tasks, events, or data where the order of arrival is crucial. They are used in operating systems, web browsers, and even in print spooling systems.

Creating a Queue (Python Example) 🎯

Let's see how to create a Queue in Python using the collections module:

python

from collections import deque

# Create a new Queue
queue = deque()

# Add elements to the Queue
queue.append('coffee')
queue.append('tea')
queue.append('milk')

# Print the Queue
print('Current Queue:', queue)

# Remove and print the first element (the coffee)
print('Dequeued:', queue.popleft())
print('Current Queue:', queue)

Output:

Current Queue: deque(['coffee', 'tea', 'milk'])
Dequeued: coffee
Current Queue: deque(['tea', 'milk'])

Real-world Applications 💡

Breadth-First Search (BFS) Algorithm in Graph Traversal
Simulating a printer queue in an operating system
Implementing a web browser's task queue

Quiz 🎯

Stay tuned for more advanced Queue topics and examples in our upcoming lessons! 🎉