Book Image

Everyday data structures

By : William Smith
Book Image

Everyday data structures

By: William Smith

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

Related Content you might be interested in

Current Title:

Small book image
Everyday data structures
William Smith
Mar, 2017 | 344 pages
Small book image
Java 9 Data Structures and Algorithms
Debasish Ray Chawdhuri
Apr, 2017 | 340 pages
Small book image
Hands-On Data Structures and Algorithms with Python – Third Edition
Dr. Basant Agarwal
Jul, 2022 | 496 pages
Small book image
PHP 7 Data Structures and Algorithms
Mizanur Rahman
May, 2017 | 340 pages
Table of Contents (20 chapters)
Everyday Data Structures
Everyday Data Structures
Credits
Credits
About the Author
About the Author
About the Reviewer
About the Reviewer
www.PacktPub.com
www.PacktPub.com
Customer Feedback
Customer Feedback
Preface
Preface
Free Chapter
1
Data Types: Foundational Structures
Data Types: Foundational Structures
Numeric data types
Boolean data type
Strings
Summary
2
Arrays: Foundational Collections
Arrays: Foundational Collections
Mutable versus immutable arrays
Advanced topics
Summary
3
Lists: Linear Collections
Lists: Linear Collections
List implementations
Instantiating lists
Revisiting users logged in to a service
Doubly linked list
Searching
A few pointers
Summary
4
Stacks: LIFO Collections
Stacks: LIFO Collections
Initializing stacks
Case study: motion planning algorithm
Advanced topics - stack implementations
Summary
5
Queues: FIFO Collections
Queues: FIFO Collections
Initializing queues
Case study: customer service
Advanced topics
Summary
6
Dictionaries: Keyed Collections
Dictionaries: Keyed Collections
Initializing dictionaries
Case study: arcade ticket totals
Advanced topics
Summary
7
Sets: No Duplicates
Sets: No Duplicates
Set theory
Initializing sets
Example: revisiting users logged in to a service
Case-study: music playlists
Advanced topics
Summary
8
Structs: Complex Types
Structs: Complex Types
The essentials
Enums
Summary
9
Trees: Non-Linear Structures
Trees: Non-Linear Structures
Tree data structure versus tree data type
Tree terminology
Common operations
Instantiating trees
Tree structures
Recursion
Traversal
Summary
10
Heaps: Ordered Trees
Heaps: Ordered Trees
Heap implementations
Heap operations
Instantiating heaps
Min heap structure
Common applications
Summary
11
Graphs: Values with Relationships
Graphs: Values with Relationships
Visual graph concepts
Graph operations
Graph implementations
The graph data structure
Summary
12
Sorting: Bringing Order Out Of Chaos
Sorting: Bringing Order Out Of Chaos
Selection sort
Insertion sort
Bubble sort
Quick sort
Merge sort
Bucket sort
Summary
13
Searching: Finding What You Need
Searching: Finding What You Need
Linear search
Binary search
Jump search
Summary

Graph implementations

As with heaps, graphs are a form of tree data structure and, therefore, we will not find a native concrete implementation in the languages we are discussing. However, the graph data structure is surprisingly easy to implement, so we will build our own Graph class from scratch.

Previous Section
End of Section 4
Next Section