Queues allow you to store data in an ordered way, where the most recent item that was added to the stack is the last item that can be removed. This is called First In, First Out, or FIFO. Learn the other key characteristics of the queue's abstract data type in this video.
- [Instructor] Let's talk about what makes…the queue class unique especially in comparison to stacks.…Here's a high level definition of what a queue is.…Queues hold a collection of items…in the order in which they were added.…Items are added to the back of a queue…and removed from the front of the queue.…If you think of a queue as a line of costumers,…a customer adds themselves to the end of the line…and eventually leaves from the front of the line.…This is called first-in first-out or FIFO.…
Note that this is subtly different from stacks…which are last-in first-out.…Queues also preserve order so when you think…about people joining a line,…the order is preserved there as well.…Just as we did for the stack class,…we can see if there is a built-in data type we could use…to implement the queue behind the scenes.…Again, we can use a list because a list…is an ordered collection of items that we can modify.…When we code our queue class,…we're going to use the right side…or end of a list to represent the front of the queue.…
Author
Released
12/6/2018- Abstract types and data structures
- Stacks as a linear abstract data type
- Creating the Stack class and its methods
- Adding items to the top and bottom of a stack
- Creating the Queue class and its methods
- Manipulating items in a queue
- Creating the Dequeue class and its methods
- Adding and removing items from a dequeue
Skill Level Advanced
Duration
Views
Related Courses
-
Learning the Python 3 Standard Library
with Kathryn Hodge2h 9m Intermediate -
Python Essential Training
with Bill Weinman4h 51m Intermediate -
Faster Python Code
with Miki Tebeka2h 4m Advanced -
Learning Python
with Joe Marini2h 27m Beginner -
Advanced Python
with Joe Marini2h 27m Advanced
-
Introduction
-
What you should know1m 26s
-
1. Abstract Data Types and Data Structures
-
Abstract data types3m 28s
-
Data structures40s
-
-
2. The Stack
-
push()3m 27s
-
pop()3m 57s
-
peek()3m 28s
-
size()1m 51s
-
is_empty()2m 13s
-
Challenge: Balanced symbols1m 10s
-
3. The Queue
-
enqueue()3m 8s
-
dequeue()3m 29s
-
peek()3m 43s
-
size() and is_empty()3m 2s
-
Challenge: Print queue1m 14s
-
Print queue solution in code4m 19s
-
4. The Deque
-
add_rear() and add_front()4m 21s
-
peek_rear() and peek_front()3m 50s
-
Conclusion
-
Next steps1m 43s
-
- Mark as unwatched
- Mark all as unwatched
Are you sure you want to mark all the videos in this course as unwatched?
This will not affect your course history, your reports, or your certificates of completion for this course.
CancelTake notes with your new membership!
Type in the entry box, then click Enter to save your note.
1:30Press on any video thumbnail to jump immediately to the timecode shown.
Notes are saved with you account but can also be exported as plain text, MS Word, PDF, Google Doc, or Evernote.
Share this video
Embed this video
Video: Queues as a linear abstract data type