Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Jump to bottom

doc(README.md): Update README #14

Open
wants to merge 1 commit into
base: master
Choose a base branch
from
Open

doc(README.md): Update README #14

Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
4 changes: 1 addition & 3 deletions data_structures/stacks_and_queues/1_create_queue/README.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -4,12 +4,10 @@
A Queue follows the First-in-First-Out (FIFO) principle. It is opened from both the ends hence we can easily add elements to the back and can remove elements from the front. Python provides us with the queue module to work with queue data structure related operations.

## Problem Description
Write a Python function that contains one queue object `queue_a` having a max size arguement value initialised to 5.
Write a Python `class Queue` using a `LinkedList`. Write a Python function that contains one queue object `queue_a` having a max size arguement value initialised to 5.
Put 5 random values to the queue object inside a function "queue" calling it from object `data`
Display the `result` object containing elements of queue.

Hint: Queue elements are not iterable , pick a data type which is iterable.

## Testing
* done

Expand Down