Learn Queues
Learn about the first-in-first-out data structure called a "queue". Study it conceptually and implement it in Python.
Start
Key Concepts
Review core concepts you need to learn to master this subject
Queue data structure methods
Queue data structure methods
The queue data structure has three main methods:
enqueue(adds a node to the back of the queue)dequeue(removes node at the front of the queue)peek(returns value of node at the front of the queue, without removing it)
Queues: Conceptual
Lesson 1 of 2
- 1A queue is a data structure which contains an ordered set of data. Queues provide three methods for interaction: - Enqueue - adds data to the “back” or end of the queue - Dequeue - provides and re…
- 2Queues can be implemented using a linked list as the underlying data structure. The front of the queue is equivalent to the head node of a linked list and the back of the queue is equivalent to th…
- 3Let’s take a minute to review what we’ve covered about queues in this lesson. Queues: - Contain data nodes - Support three main operations: - Enqueue adds data to the back of the queue - Dequeue…
How you'll master it
Stress-test your knowledge with quizzes that help commit syntax to memory
