Skip to Content
Hands-On Data Structures and Algorithms with Python - Second Edition
book

Hands-On Data Structures and Algorithms with Python - Second Edition

by Dr. Basant Agarwal, Benjamin Baka, David Julian
October 2018
Beginner to intermediate
398 pages
11h 1m
English
Packt Publishing
Content preview from Hands-On Data Structures and Algorithms with Python - Second Edition

The enqueue operation

The enqueue operation adds an item to the queue. It uses the insert method of the list class to insert items (or data) at the front of the list. See the following code for the implementation of the enqueue method:

  def enqueue(self, data):     self.items.insert(0, data)   # Always insert items at index 0    self.size += 1               # increment the size of the queue by 1

It is important to note how we implement insertions in queues using list. The concept is that we add the items at index 0 in a list; it is the first position in an array or list. To understand the concept of how the queue works when we add items at index 0 in a list, consider the following diagram. We start with an empty list. Initially, we add an item 1 at index 0. Next, ...

Become an O’Reilly member and get unlimited access to this title plus top books and audiobooks from O’Reilly and nearly 200 top publishers, thousands of courses curated by job role, 150+ live events each month,
and much more.
Start your free trial

You might also like

Hands-On Data Structures and Algorithms with Python - Third Edition

Hands-On Data Structures and Algorithms with Python - Third Edition

Dr. Basant Agarwal
Data Structures & Algorithms in Python

Data Structures & Algorithms in Python

John Canning, Alan Broder, Robert Lafore
Data Structures and Algorithms in Python

Data Structures and Algorithms in Python

Michael T. Goodrich, Roberto Tamassia, Michael H. Goldwasser

Publisher Resources

ISBN: 9781788995573Supplemental Content