Data Structures and the Java Collections Framework, 3rd Edition

Instead of emphasizing the underlying mathematics to get programmers to build their own data structures, Collins enables them to manipulate existing structures in the Java Collections Library. This allows them to learn through coding rather than by doing proofs. 23 lab projects and hundreds of programming examples are integrated throughout the pages to build their intuition. The approach this book takes helps programmers quickly learn the concepts that underlie data structures.

Table of Contents

CHAPTER 0 Introduction to Java
CHAPTER 1 Object-Oriented Concepts
CHAPTER 2 Additional Features of Programming and Java
CHAPTER 3 Analysis of Algorithms
CHAPTER 4 The Java Collections Framework
CHAPTER 5 Recursion
CHAPTER 6 Array-Based Lists
CHAPTER 7 Linked Lists
CHAPTER 8 Stacks and Queues
CHAPTER 9 Binary Trees
CHAPTER 10 Binary Search Trees
CHAPTER 11 Sorting
CHAPTER 12 Tree Maps and Tree Sets
CHAPTER 13 Priority Queues
CHAPTER 14 Hashing
CHAPTER 15 Graphs, Trees, and Networks
APPENDIX 1 Additional Features of the JAVA Collections Framework
APPENDIX 2 Mathematical Background
APPENDIX 3 Choosing a Data Structure