Data Structures and Algorithms Using Java

With an accessible writing style and manageable content, Data Structures and Algorithms using Java is the ideal text for your course. It covers the entire recommended syllabus put forth by the Association of Computing Machinery (ACM) standard curriculum guidelines for "Algorithms and Data Structures." The authors main motivation for writing the text was to produce a text that was more readable and instructional than those currently in print without compromising the scope of the CS103 course material. McAllister does just that with his unique student-friendly pedagogical approach and organizational structure. The pedagogical features of the text, based on the author's 30 years of teaching experience, include succinct code examples, a unique common template used as the organizational basis of each chapter, the use of pseudocode to present the major algorithms developed in the text, 300 carefully designed figures, and a review of Java.

PrefacePreface
ChapterChapter 1 Overview and Java Review
ChapterChapter 2 Array-Based Structures
ChapterChapter 3 Restricted Structures
ChapterChapter 4 Linked Lists and Iterators
ChapterChapter 5 Hashed Data Structures
ChapterChapter 6 Recursion
ChapterChapter 7 Trees
ChapterChapter 8 Sorting
ChapterChapter 9 Graphs
AppendixAppendices