Search icon CANCEL
Subscription
0
Cart icon
Your Cart (0 item)
Close icon
You have no products in your basket yet
Arrow left icon
Explore Products
Best Sellers
New Releases
Books
Videos
Audiobooks
Learning Hub
Free Learning
Arrow right icon
Arrow up icon
GO TO TOP
Getting Started with Python

You're reading from   Getting Started with Python Understand key data structures and use Python in object-oriented programming

Arrow left icon
Product type Course
Published in Feb 2019
Publisher Packt
ISBN-13 9781838551919
Length 722 pages
Edition 1st Edition
Languages
Arrow right icon
Authors (3):
Arrow left icon
Benjamin Baka Benjamin Baka
Author Profile Icon Benjamin Baka
Benjamin Baka
Fabrizio Romano Fabrizio Romano
Author Profile Icon Fabrizio Romano
Fabrizio Romano
Dusty Phillips Dusty Phillips
Author Profile Icon Dusty Phillips
Dusty Phillips
Arrow right icon
View More author details
Toc

Table of Contents (31) Chapters Close

Title Page
Copyright and Credits
About Packt
Contributors
Preface
1. A Gentle Introduction to Python FREE CHAPTER 2. Built-in Data Types 3. Iterating and Making Decisions 4. Functions, the Building Blocks of Code 5. Files and Data Persistence 6. Principles of Algorithm Design 7. Lists and Pointer Structures 8. Stacks and Queues 9. Trees 10. Hashing and Symbol Tables 11. Graphs and Other Algorithms 12. Searching 13. Sorting 14. Selection Algorithms 15. Object-Oriented Design 16. Objects in Python 17. When Objects Are Alike 18. Expecting the Unexpected 19. When to Use Object-Oriented Programming 20. Python Object-Oriented Shortcuts 21. The Iterator Pattern 22. Python Design Patterns I 23. Python Design Patterns II 24. Testing Object-Oriented Programs 1. Other Books You May Enjoy Index

Queues


Another special type of list is the queue data structure. This data structure is no different from the regular queue you are accustomed to in real life. If you have stood in line at an airport or to be served your favorite burger at your neighborhood shop, then you should know how things work in a queue.

Queues are also a very fundamental and important concept to grasp since many other data structures are built on them.

The way a queue works is that the first person to join the queue usually gets served first, all things being equal. The acronym FIFO best explains this. FIFO stands for first in, first out. When people are standing in a queue waiting for their turn to be served, service is only rendered at the front of the queue. The only time people exit the queue is when they have been served, which only occurs at the very front of the queue. By strict definition, it is illegal for people to join the queue at the front where people are being served:

To join the queue, participants must...

lock icon The rest of the chapter is locked
Register for a free Packt account to unlock a world of extra content!
A free Packt account unlocks extra newsletters, articles, discounted offers, and much more. Start advancing your knowledge today.
Unlock this book and the full library FREE for 7 days
Get unlimited access to 7000+ expert-authored eBooks and videos courses covering every tech area you can think of
Renews at $19.99/month. Cancel anytime
Banner background image