Search icon CANCEL
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

Conventions

In this book, you will find a number of text styles that distinguish between different kinds of information. Here are some examples of these styles and an explanation of their meaning.

Each chapter of this book will also include a case study, or similar code example, that will be broken down and detailed to explain how the data structure is applied.  As such, this book is full of code examples.

A block of code is set as follows:

    public boolean isEmpty()
    {
        return this._commandStack.empty();
    }

When we wish to draw your attention to a particular part of a code block, the relevant lines or items are set in bold:

    func canAddUser(user: EDSUser) -> Bool 
    { 
        if (_users.contains(user)) 
        { 
            return false; 
        } else {
            return true; 
    }

New terms and important words are shown in bold. Words that you see on the screen, for example, in menus or dialog boxes, appear in the text like this: "The first validation method, isFull(), checks if our stack has reached its capacity."

We will also discuss algorithms and mathematical concepts related to algorithms in this text. Whenever operational cost values written in Big-O notation are shown they appear as follows: "This is small consolation, however, because the selection sort algorithm still has an O(n2) complexity cost."

Likewise, when mathematical formulas and algorithms are used, they will appear as follows: "Our algorithm will find the smallest value in S[0...4], which in this case is 3, and place it at the beginning of S[0...4]."

Note

Warnings or important notes appear in a box like this.

Tip

Tips and tricks appear like this.

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 €18.99/month. Cancel anytime