In this chapter, you learned the basic definition of the queue data structure, including how to initialize concrete implementations of the structure in each of the four languages we are discussing. Next, we discussed the most common operations associated with the queue data structure and their operational cost. We examined an example application using queues to track customers waiting in a *first-come, first-served* line. These examples demonstrated how C# and Java provided concrete implementations of a queue, whereas Objective-C and Swift do not. Following this, we examined the three most common types of queue implementations, including array-based, linked-list based, and heap-based queues. Finally, we looked at double-ended and priority variations of the queue data structure.

#### Everyday data structures

##### By :

#### Everyday data structures

##### By:

#### Overview of this book

Explore a new world of data structures and their applications easily with this data structures book. Written by software expert William Smith, you?ll learn how to master basic and advanced data structure concepts. ? Fully understand data structures using Java, C and other common languages ? Work through practical examples and learn real-world applications ? Get to grips with data structure problem solving using case studies

Table of Contents (20 chapters)

Everyday Data Structures

Credits

About the Author

About the Reviewer

www.PacktPub.com

Customer Feedback

Preface

Free Chapter

Data Types: Foundational Structures

Arrays: Foundational Collections

Lists: Linear Collections

Stacks: LIFO Collections

Queues: FIFO Collections

Dictionaries: Keyed Collections

Sets: No Duplicates

Structs: Complex Types

Trees: Non-Linear Structures

Heaps: Ordered Trees

Graphs: Values with Relationships

Sorting: Bringing Order Out Of Chaos

Searching: Finding What You Need

Customer Reviews