Weiss, Mark Allen <br/><br/>
Data structures and problem solving using Java 
/ Mark Allen Weiss 
 - USA :  Addison Wesley,  1999 
 - xxxii, 780 p.  
<br/><br/>1.	Primitive java <br/>2.	References <br/>3.	Objects and classes <br/>4.	Inheritance <br/>5.	Data structures<br/>6.	Recurison <br/>7.	Sorting algorithms <br/>8.	Ranomization <br/>9.	Stacks and compilers <br/>10.	Utilities <br/>11.	Simulation <br/>12.	Graphs and paths <br/>13.	Stacks and queues <br/>14.	Linked lists<br/>15.	Trees <br/>16.	Binary search trees<br/>17.	Hash tables <br/>18.	A priority queue:  the binary heap <br/>19.	Splay trees <br/>20.	Meging priority queues <br/>21.	The disjoint set class<br/> 
<br/><br/><label>ISBN: </label>9780201549911 
<br/><br/><label>Subjects--Topical Terms: </label><br/>Data structures (Computer science<br/>Java (Computer program language)<br/>Problem solving--Data processing<br/>Computer algorithms
<br/><br/><label>Dewey Class. No.: </label>005.73  / W4361