*n* additional pointers where *n* is the length of the list. This additional pointer provides for simple reverse-traversal of the list. The added overhead is somewhat negligible and can typically be ignored except in very special cases. The append, insert, and remove operations still only cost **O**(1).

#### 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