Skip to Content
Python Data Structures and Algorithms
book

Python Data Structures and Algorithms

by Benjamin Baka
May 2017
Intermediate to advanced
310 pages
8h 5m
English
Packt Publishing
Content preview from Python Data Structures and Algorithms

Enqueue operation

Elements are added to a Queue object via the enqueue method. The elements in this case are the nodes:

    def enqueue(self, data):         new_node = Node(data, None, None)         if self.head is None:             self.head = new_node             self.tail = self.head         else:             new_node.prev = self.tail             self.tail.next = new_node             self.tail = new_node         self.count += 1 

The enqueue method code is the same code already explained in the append operation of the doubly linked list. It creates a node from the data passed to it and appends it to the tail of the queue, or points both self.head and self.tail to the newly created node if the queue is empty. The total count of elements in the queue is increased by the line self.count += 1.

 

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

Data Structures and Algorithms in Python

Data Structures and Algorithms in Python

Michael T. Goodrich, Roberto Tamassia, Michael H. Goldwasser
Hands-On Data Structures and Algorithms with Python - Second Edition

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

Dr. Basant Agarwal, Benjamin Baka, David Julian
Data Structures & Algorithms in Python

Data Structures & Algorithms in Python

John Canning, Alan Broder, Robert Lafore

Publisher Resources

ISBN: 9781786467355Supplemental Content