Data Structures with Java

by John R. Hubbard, Anita Huray

This book covers all the main data structures and algorithms reccommended by the ACM. It is current, well-written, and clearly understandable, with many illustrations, explanations, and examples of Java-based data structures. Using Java 1.4 throughout, this book covers such topics as polymorphism, simulation, abstract classes, inner classes, and reflection. For computer department and systems employees needing to learn programming concepts and Java techniques.

Genres: Computer Science

700 pages, Hardcover

First published November 17, 2000

About the author

Librarian note:
There is more than one author in the GoodReads database with this name

John R. Hubbard is a Professor Emeritus of Mathematics and Computer Science at the University of Richmond.

Reviews

[Karthik Dasyam · Rating 5 out of 5]

Linked Data Structures
--------------------------------------
1. The actual value of the reference is the memory address of the object to which it refers. In other programming languages, such variables are called pointers.
2. The value null means that the variable does not refer to any object.
3. Each node object is shown as a big with two parts: the left side contains the integer data, and the right side contains the next reference.

[Bhavna Dewani]

its a good book

[Nima Omidan]

simple look to Java cup.