Guide to Data Structures

1. Front Matter

   Pages i-xiii

   PDF

2. Preliminary Concepts

   • James T. Streib, Takako Soma

   Pages 1-16

3. Stacks Using Arrays

   • James T. Streib, Takako Soma

   Pages 17-47

4. Queues Using Arrays

   • James T. Streib, Takako Soma

   Pages 49-75

5. Lists Using Arrays

   • James T. Streib, Takako Soma

   Pages 77-107

6. Lists Using Objects and References

   • James T. Streib, Takako Soma

   Pages 109-133

7. Ordered Linked Lists

   • James T. Streib, Takako Soma

   Pages 135-172

8. Stacks and Queues Using References

   • James T. Streib, Takako Soma

   Pages 173-198

9. Binary Trees

   • James T. Streib, Takako Soma

   Pages 199-248

10. Sorting

    • James T. Streib, Takako Soma

    Pages 249-291

11. Heaps

    • James T. Streib, Takako Soma

    Pages 293-338

12. Hashing

    • James T. Streib, Takako Soma

    Pages 339-362

13. Back Matter

    Pages 363-376

    PDF

This accessible and engaging textbook/guide provides a concise introduction to data structures and associated algorithms. Emphasis is placed on the fundamentals of data structures, enabling the reader to quickly learn the key concepts, and providing a strong foundation for later studies of more complex topics. The coverage includes discussions on stacks, queues, lists, (using both arrays and links), sorting, and elementary binary trees, heaps, and hashing. This content is also a natural continuation from the material provided in the separate Springer title Guide to Java by the same authors.Topics and features: reviews the preliminary concepts, and introduces stacks and queues using arrays, along with a discussion of array-based lists; examines linked lists, the implementation of stacks and queues using references, binary trees, a range of varied sorting techniques, heaps, and hashing; presents both primitive and generic data types in each chapter, and makes use of contour diagrams to illustrate object-oriented concepts; includes chapter summaries, and asks the reader questions to help them interact with the material; contains numerous examples and illustrations, and one or more complete program in every chapter; provides exercises at the end of each chapter, as well as solutions to selected exercises, and a glossary of important terms.

This clearly-written work is an ideal classroom text for a second semester course in programming using the Java programming language, in preparation for a subsequent advanced course in data structures and algorithms. The book is also eminently suitable as a self-study guide in either academe or industry.

• Binary Trees
• Data Structures
• Java
• Searching and Sorting Algorithms
• Stacks, Queues and Lists

“This text is intended to provide undergraduates using Java with a concise, focused, and relatively simple coverage of some of the basic data structures in use. These include arrays, linked lists, trees, heaps (in arrays), and hash tables. … The book covers the algorithms and data structures well with clear language, abundant diagrams, and good exercises. It could be a good introduction for curricula using Java as a primary teaching language.” (Jeffrey Putnam, Computing Reviews, July, 2018)​

• Illinois College, Jacksonville, USA

  James T. Streib, Takako Soma

Dr. James T. Streib is a Professor of Computer Science at Illinois College, Jacksonville, IL, USA. Dr. Takako Soma is an Associate Professor of Computer Science at the same institution.

Policies and ethics