Search icon CANCEL
Subscription
0
Cart icon
Your Cart (0 item)
Close icon
You have no products in your basket yet
Save more on your purchases now! discount-offer-chevron-icon
Savings automatically calculated. No voucher code required.
Arrow left icon
Explore Products
Best Sellers
New Releases
Books
Videos
Audiobooks
Learning Hub
Conferences
Free Learning
Arrow right icon
Arrow up icon
GO TO TOP
Everyday data structures

You're reading from   Everyday data structures A practical guide to learning data structures simply and easily

Arrow left icon
Product type Paperback
Published in Mar 2017
Publisher Packt
ISBN-13 9781787121041
Length 344 pages
Edition 1st Edition
Languages
Arrow right icon
Author (1):
Arrow left icon
William Smith William Smith
Author Profile Icon William Smith
William Smith
Arrow right icon
View More author details
Toc

Table of Contents (14) Chapters Close

Preface 1. Data Types: Foundational Structures FREE CHAPTER 2. Arrays: Foundational Collections 3. Lists: Linear Collections 4. Stacks: LIFO Collections 5. Queues: FIFO Collections 6. Dictionaries: Keyed Collections 7. Sets: No Duplicates 8. Structs: Complex Types 9. Trees: Non-Linear Structures 10. Heaps: Ordered Trees 11. Graphs: Values with Relationships 12. Sorting: Bringing Order Out Of Chaos 13. Searching: Finding What You Need

Initializing queues


Each language provides varying levels of support for the queue data structure. Here are some examples of initializing the collection, adding an object to the back of the collection, and then removing the head object from the head of the collection.

C#

C# provides a concrete implementation of the queue data structure through the Queue<T> generic class:

    Queue<MyObject> aQueue = new Queue<MyObject>(); 
    aQueue.Enqueue(anObject); 
    aQueue.Dequeue(); 
Java

Java provides the abstract Queue<E> interface, and several concrete implementations of the queue data structure use this interface. Queue is also extended to the Deque<E> interface that represents a double-ended queue. The ArrayDeque<E> class is one concrete implementation of the Deque<E> interface:

    ArrayDeque<MyObject> aQueue = new ArrayDeque<MyObject>(); 
    aQueue.addLast(anObject); 
    aQueue.getFirst(); 

Objective-C

Objective...

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 £16.99/month. Cancel anytime