Log in to track your reading progress.
Synopsis
This textbook for a course on data structures and algorithms introduces both linear and non-linear collections, and illustrates how the particular nature of the collections can be useful when solving problems. Lewis (Villanova University) and Chase (Radford University) cover recursion, stacks, queues, lists, trees, heaps, hashing, and graphs. An appendix lists the most commonly used classes in the Java class library. Annotation ©2004 Book News, Inc., Portland, OR
Book Details
Published
December 1, 2004
Publisher
Addison Wesley
Format
Paperback
ISBN
9780321245847