Data Structures and Algorithm Analysis in Java

I would understand if the author would omit some topics based on the premise that students should already know them, but instead he chooses to contain everything( and as a result contain nothing in particular).

On the other hand in more "advanced" topic sections it is not unusual to find statements of the sort "beyond the scope of this book". Which leads me (and many others) to ask, what is the scope of this book?

The good:

-lots of analysis about advantage and disadvantage in each algorithm (especially in sorting).

-various and good idea in example implementation such as using tree traversal to evaluate expression or the use of disjoint set in making maze! (I like it.)

The bad :

-deep (and too much) mathemetical analysis in each data type and algorithm, is sometimes too hard to understand (and may be not necessary for me at all).

-no context describing basic Java (e.g. How to compile java code; concept about method, object, instance, class).

-after all, I think it costs too expensive for black and white text and poor illustration.