Data structures and abstractions with JavaTM / Frank M. Carrano and Timothy M. Henry

Introduction: organizing data -- 1. Bags -- 2. Bag implementations that use arrays -- 3. A bag implementation that links data -- 4.The efficiency of algorithms -- 5.Stacks -- 6.Stack implementations -- 7. Recursion -- 8. An introduction to sorting -- 9. Faster sorting methods -- 10.Queues, deques, and priority queues -- 11. Queue, deque, and priority queue implementations -- 12. Lists -- 13. A list implementation that uses an array -- 14. A list implementation that links data -- 15. Iterators for the ADT list -- 16. Sorted lists -- 17. Inheritance and lists -- 18. Searching -- 19. Dictionaries -- 20. Dictionary implementations -- 21.Introducing hashing -- 22. Hashing as a dictionary implementation -- 23.Trees -- 24. Tree implementations -- 25. A binary search tree implementation -- 26. A heap implementation -- 27. Balanced search trees -- 28. Graphs -- 29. Graph implementations.

Data Structures and Abstractions with Java is suitable for one- or two-semester courses in data structures (CS-2) in the departments of Computer Science, Computer Engineering, Business, and Management Information Systems. This book is also useful for programmers and software engineers interested in learning more about data structures and abstractions. This is the most student-friendly data structures text available that introduces ADTs in individual, brief chapters — each with pedagogical tools to help students master each concept. Using the latest features of Java, this unique object-oriented presentation makes a clear distinction between specification and implementation to simplify learning, while providing maximum classroom flexibility.