From 09875239f796af84b171ff17eac769389858f12b Mon Sep 17 00:00:00 2001 From: Lester Kim Date: Sat, 18 Jul 2020 06:15:54 -0400 Subject: [PATCH] doc(README.md): Update README --- data_structures/stacks_and_queues/1_create_queue/README.md | 4 +--- 1 file changed, 1 insertion(+), 3 deletions(-) diff --git a/data_structures/stacks_and_queues/1_create_queue/README.md b/data_structures/stacks_and_queues/1_create_queue/README.md index be497804..64336b12 100644 --- a/data_structures/stacks_and_queues/1_create_queue/README.md +++ b/data_structures/stacks_and_queues/1_create_queue/README.md @@ -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