#Queue data structure python code#

If the queue is empty, we display a message indicating that the queue is empty. If the queue is not empty, we print all the elements in the queue using a `for` loop. If the user enters `’3’`, we again check if the queue is not empty (`len(queue) > 0`). If the queue is not empty, we use the `popleft()` method to remove the element at the front of the queue, and we print the removed element. If the user enters `’2’`, we first check if the queue is not empty (`len(queue) > 0`). Print(“Removed element:”, removed_element) We display a message indicating that the element has been added to the queue. The element is then appended to the end of the queue using the `append()` method. If the user enters `’1’`, we prompt them to enter an element to add to the queue using the `input()` function.

Perform the corresponding action based on the user’s choice:Įlement = input(“Enter an element to add: “).

The user’s input is stored in the `choice` variable as a string. We use the `input()` function to prompt the user to enter their choice. We print the menu options to the console, presenting the available actions to the user.Ĭhoice = input(“Enter your choice (1-4): “) We use an infinite `while` loop, which means the loop will keep running until we explicitly break out of it. This creates an empty queue object that we will use to store the elements. We create an empty queue using the `deque()` constructor from the `deque` class.

The `deque` class provides an implementation of a double-ended queue, which we will use to create a queue data structure. Here, we import the `deque` class from the `collections` module.

#Queue data structure python code#

Let’s go through the code step by step to understand how the menu-driven script works: