For a one-semester, undergraduate course in Data Structures This text covers the essentials of Data Structures, including the fundamentals and abstractions that - when introduced at this level - fully prepare students for their study of algorithms in the subsequent courses. Clear, precise coverage, student-friendly language, and the appropriate level of mathematical rigor combine in this text for a comprehensive introduction to the material.
Table of Contents:
(NOTE: Each chapter contains a Chapter Summary, Exercises, Programming Problems, Projects, and Review Questions.)
1. Object-Oriented Programming.
2. Abstract Data Types.
3. Arrays.
4. Linked Structures.
5. Stacks.
6. Queues.
7. Collections.
8. Lists.
9. Hash Tables.
10. Recursion.
11. Trees.
12. Binary Trees.
13. Search Trees.
14. Heaps and Priority Queues.
15. Sorting.
16. Graphs.
Appendix A: Answers and Hints.
Appendix B: Java Review.
Appendix C: Essential Mathematics.
Appendix D: The Java Collections Framework.
Appendix E: References.
