Classic Data Structures in Java

Hallmarks of classics data structures in Java:

• An object-oriented organization is used from the beginning, and object-oriented techniques are used in the development of all examples
  
• A clear separation between the Abstract Data Type (interface) and the implementation is emphasized throughout the book.
  
• An explorational and visual approach is encouraged by providing tools that make it easy for readers to create a visual record of time, and by describing experiments that help readers see aspects of execution that may not be obvious from the code.
  
• Important software patterns are highlighted and emphasized from the start.
  
• Interesting graphical elements of Java are carefully chosen to minimize unnecessary details and emphasize the important lessons.
  
• Extensive pedagogy-including motivational sidebars, chapter summaries, collections of key terms, a series of study questions, and programming projects-is featured throughout the book.
  

• The Management of Complexity
  
• Abstract Data Types
  
• Algorithms
  
• Execution-Time Measurement
  
• Increasing Confidence in Correctness
  
• Vectors
  
• Sorting Vectors
  
• Linked Lists
  
• List Variations
  
• Stacks
  
• Deques
  
• Queues
  
• Trees
  
• Binary Serch Trees
  
• Priority Queues
  
• Hash Tables
  
• Maps
  
• Sets
  
• Matrices
  
• Graphs
  
• Appendixes